The "log rank" conjecture for modular communication complexity

Computational Complexity

Volumn 10, Issue 1, 2001, Pages 70-91

  Meinel, Christoph ^a   Waack, Stephan ^b  

^a UNIVERSITY OF TRIER   (Germany)

^b UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

"Log rank" conjecture; Circuit lower bounds; Communication protocols; Depth two circuits; Modular acceptance modes

Indexed keywords

EID: 0035730152     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00001612     Document Type: Article

References (22)

1. A. BORODIN, A. RAZBOROV AND R. SMOLENSKY (1993). On lower bounds for read-k-times branching programs. Comput. Complexity 3, 1-18.
2. C. DAMM, M. KRAUSE, C. MEINEL AND S. WAACK (1992). Separating counting communication complexity classes. In Proc. 9th STACS, Lecture Notes in Comput. Sci. 577, Springer, 281-293.
3. A. HAJNAL, W. MAASS AND G. TURAN (1988). On the communication complexity of graph problems. In Proc. 20th ACM STOC, 186-191.
4. J. HROMKOVIČ (1997). Communication Complexity and Parallel Computing. Springer.
5. M. KRAUSE AND ST. WAACK (1991). Variation ranks of communication matrices and lower bounds for depth-two circuits having symmetric gates with unbounded fan-in. In Proc. 32nd IEEE FOCS, 777-782.
6. E. KUSHILEVITZ AND N. NISAN (1997). Communication Complexity. Cambridge Univ. Press.
7. S. LOKAM (1995). Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity. In Proc. 36th IEEE FOCS.
8. L. LOVÁSZ (1990). Communication complexity: A survey, in: Paths, flows and VLSI-layouts, Springer, 235-266.
9. L. LOVÁSZ AND M. SAKS (1993). Communication complexity and combinatorial lattice theory. J. Comput. System Sci. 47, 322-349.
10. K. MEHLHORN AND E. M. SCHMIDT (1982). Las Vegas is better than determinism in VLSI and distributed computing. In Proc. 14th ACM STOC, 330-337.
11. N. NISAN AND A. WIGDERSON (1995). On rank vs. communication complexity. Combinatorica 15, 557-566.
12. P. PUDLÁK (1994). Large communication in constant depth circuits. Combinatorica 14, 203-216.
13. R. RAZ AND B. SPIEKER (1993). On the "log rank"-conjecture in communication complexity. In Proc. 34th IEEE FOCS, 168-176.
14. A. A. RAZBOROV (1987). Lower bounds for the size of circuits of bounded depth with basis {Λ, ⊕}. Mat. Zametki 41, 598-607.
15. G.-C. ROTA (1964). On the foundations of combinatorial theory: I. Theory of Möbius functions. Z. Wahrsch. Verw. Gebiete 2, 340-368.
16. V. SHOUP AND R. SMOLENSKY (1996/97). Lower bounds for polynomial evaluation and interpolation problems. Comput. Complexity 6, 301-311.
17. S. SKYUM AND L. G. VALIANT (1985). A complexity theory based on Boolean algebra. J. Assoc. Comput. Mach. 32, 484-502.
18. R. SMOLENSKY (1987). Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proc. 19th ACM STOC, 77-82.
19. A. WIGDERSON (1992). The complexity of graph connectivity. In Mathematical Foundations of Computer Science (Prague), Lecture Notes in Comput. Sci. 629, Springer, 112-132.
20. S. WILF (1968). Hadamard determinants, Möbius functions and the chromatic number of graphs. Bull. Amer. Math. Soc. 74, 960-964.
21. A. C.-C. YAO (1979). Some complexity questions related to distributed computing. In Proc. 11st ACM STOC, 209-213.
22. A. C.-C. YAO (1990). On ACC and threshold circuits. In Proc. 31st IEEE FOCS, 619-627.