Author:
Damm Carsten,Krause Matthias,Meinel Christoph,Waack Stephan
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference23 articles.
1. A.V. Aho, J.D. Ullman, M. Yannakakis, On notions of information transfer in VLSI circuits, Proceedings of the 15th ACM STOC, 1983, pp. 133–183.
2. Meanders, Ramsey theory and lower bounds for branching programs;Alon;J. Comput. System Sci.,1988
3. L. Babai, P. Frankl, J. Simon, Complexity classes in communication complexity theory, Proceedings of the 27th IEEE FOCS, 1986, pp. 337–347.
4. Multiparty protocols and logspace-hard pseudorandom sequences;Babai;J. Comput. System Sci.,1992
5. Relativized counting classes: relations among thresholds, parity, and mods;Beigel;J. Comput. System Sci.,1991
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Landscape of Communication Complexity Classes;computational complexity;2018-03-22
2. On a Theorem of Razborov;computational complexity;2011-10-21
3. Communication Complexity with Synchronized Clocks;2010 IEEE 25th Annual Conference on Computational Complexity;2010-06
4. On Toda’s Theorem in Structural Communication Complexity;Lecture Notes in Computer Science;2009
5. On Computation and Communication with Small Bias;Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07);2007-06