Abstract
The “log rank” conjecture consists of the question how exactly the deterministic communication complexity of a problem can be determined in terms of algebraic invariants of the communication matrix of this problem. In the following, we answer this question in the context of modular communication complexity. We show that the modular communication complexity can be characterised precisely in terms of the logarithm of a certain rigidity function of the communication matrix. Thus, we are able to determine precisely the modular communication complexity of several problems, such as, e.g., set disjointness, comparability, and undirected graph connectivity. From the obtained bounds for the modular communication complexity, we can conclude exponential lower bounds on the size of depth two circuits having arbitary symmetric gates at the bottom level and a MODm-gate at the top.
Preview
Unable to display preview. Download preview PDF.
References
A. Borodin, A. Razborov, R. Smolensky, On Lower Bounds for Read-k-Times Branching Programs, Computational Complexity 3(1993), pp. 1–18.
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.
A. Hajnal, W. Maass, G. Turan, On the Communication Complexity of Graph Problems, in: Proc. 20th ACM STOC 1988, pp. 186–191.
M. Krause, St. Waack, Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fanin, in: Proc. 32nd IEEE FOCS 1991, pp. 777–782.
S. Lokam, Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity, in: Proc. 36th IEEE FOCS 1995.
L. Lovasz, Communication complexity: A survey, in: Paths, Flows and VLSI-Layouts, Springer-Verlag 1990, pp. 235–266.
L. Lovasz, M. Saks, Communication Complexity and Combinatorial Lattice Theory, Journal of Computer and System Sciences 47(1993), pp. 322–349.
Ch. Meinel, St. Waack, The M” obius Function, Variation Ranks, and Θ(n) — Bounds on the Modular Communication Complexity of the Undirected Graph Connectivity Problem, ECCC-Report TR94-022.
K. Mehlhorn, E. M. Schmidt, Las Vegas is Better than Determinism in VLSI and Distributed Computing, in: Proc. 14th ACM STOC 1982, pp. 330–337.
P. Pudlak, Large Communication in Constant Depth Circuits, Combinatorica 14(2)(1994), pp. 203–216.
A.A. Razborov, Lower bounds for the size of circuits of bounded depth with basis {∧, ⊕}, Journ. Math. Zametki 41(1987), pp. 598–607.
A.A. Razborov, On Rigid Matrices, Manuscript.
R. Raz, B. Spieker, On the “log rank”— Conjecture in Communication Complexity, in: Proc. 34th IEEE FOCS 1993, pp. 168–176.
L. Skyum, L. V. Valiant, A Complexity Theory Based on Boolean Algebra, in: Proc. 22th IEEE FOCS, pp. 244–253.
V. Shoup, R. Smolensky, Lower Bounds for Polynomial Evaluation and Interpolation, in: Proc. 32nd IEEE FOCS (1991), pp. 378–383.
R. Smolensky, Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity, in: Proc. 19th ACM STOC (1987), pp. 77–82.
A. Wigderson, The Complexity of Graph Connectivity, TR 92-19, Leibnitz Center for Research in Computer Science, Institute of Computer Science, Hebrew University, Jerusalem.
A. C.-C. Yao, Some Complexity Questions Related to Distributed Computing, in: Proc. 11st ACM STOC 1979, pp. 209–213.
A. C.-C. Yao, On ACC and Threshold Circuits, in: Proc. 31st IEEE FOCS 1990, pp. 619–627.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meinel, C., Waack, S. (1996). The “log rank” conjecture for modular communication complexity. In: Puech, C., Reischuk, R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_50
Download citation
DOI: https://doi.org/10.1007/3-540-60922-9_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60922-3
Online ISBN: 978-3-540-49723-3
eBook Packages: Springer Book Archive