The “log rank” conjecture for modular communication complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1046, Issue , 1996, Pages 617-630

  Meinel, Christoph ^a   Waack, Stephan ^b  

^a UNIVERSITY OF TRIER   (Germany)

^b UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MATRIX ALGEBRA;

COMMUNICATION COMPLEXITY; COMMUNICATION MATRIXES; DEPTH-TWO CIRCUITS; DETERMINISTIC COMMUNICATIONS; DISJOINTNESS; LOWER BOUNDS; SYMMETRIC GATES; UNDIRECTED GRAPH;

COMPUTATIONAL COMPLEXITY;

EID: 84948135289     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_50     Document Type: Conference Paper

References (19)

1. A. Borodin, A. Razborov, R. Smolensky, On Lower Bounds for Read-k-Times Branching Programs, Computational Complexity 3(1993), pp. 1-18.
2. C. Damm, M. Krause, Ch. Meinel, St. Waack, Separating Counting Communication Complexity Classes, in: Proc. 9th STACS, Lecture Notes in Computer Science 577, Springer Verlag 1992, pp. 281-293.
3. A. Hajnal, W. Maass, G. Turan, On the Communication Complexity of Graph Problems, in: Proc. 20th ACM STOC 1988, pp. 186-191.
4. M. Krause, St. Waack, Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-in, in: Proc. 32nd IEEE FOCS 1991, pp. 777-782.
5. S. Lokam, Spectral Methods for Matrix Rigidity with AppL'cations to Size-Depth Tradeoffs and Communication Complexity, in: Proc. 36th IEEE FOCS 1995.
6. L. Lovasz, Communication complexity: A survey, in: Paths, Flows and VLS1-Layouts, Springer-Verlag 1990, pp. 235-266.
7. L. Lovasz, M. Ssiks, Communication Complexity and Combinatorial Lattice Theory, Journal of Computer and System Sciences 47(1993), pp. 322-349.
8. Ch. Meinel, St. Waack, The Mobius Function, Variation Ranks, and θ{n}-Bounds on the Modular Communication Complexity of the Undirected Graph Connectivity Problem, ECCC-Report TR94-022.
9. K. Mehlhom, E. M. Schmidt, Las Vegas is Better than Determinism in VLSI and Distributed Computing, in: Proc. 14th ACM STOC 1982, pp. 330-337.
10. P. Pudlak, Large Communication in Constant Depth Circuits, Combinatorica 14(2)(1994), pp. 203-216.
11. A. A. Razborov, Lower bounds for the size of circuits of bounded depth with basis {A,®}, Joum. Math. Zametki 41(1987), pp. 598-607.
12. A.A. Razborov, On Rigid Matrices, Manuscript.
13. R. Raz, B. Spieker, On the "log rank"-Conjecture in Communication Complexity, in: Proc. 34th IEEE FOCS 1993, pp. 168-176.
14. L. Skyum, L. V. Valiant, A Complexity Theory Based on Boolean Algebra, in: Proc. 22th IEEE FOCS, pp. 244-253.
15. V. Shoup, R. Smolensky, Lower Bounds for Polynomial Evaluation and Interpolation, in: Proc. 32nd IEEE FOCS (1991), pp. 378-383.
16. R. Smolensky, Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity, in: Proc. 19th ACM STOC (1987), pp. 77-82.
17. A. Wigderson, The Complexity of Graph Connectivity, TR 92-19, Leibnitz Center for Research in Computer Science, Institute of Computer Science, Hebrew Univer-, sity, Jerusalem.
18. A. C.-C. Yao, Some Complexity Questions Related to Distributed Computing, in: Proc. list ACM STOC 1979, pp. 209-213.
19. A. C.-C. Yao, On ACC and Threshold Circuits, in: Proc. 31st IEEE FOCS 1990, pp. 619-627.