Rectangle size bounds and threshold covers in communication complexity

We investigate the power of the most important lower bound technique in randomized communication complexity, which is based on an evaluation of the maximal size of approximately monochromatic rectangles, with respect to arbitrary distributions on the inputs. While it is known that the 0-error version of this bound is polynomially tight for deterministic communication, nothing in this direction is known for constant error and randomized communication complexity. We first study a one-sided version of this bound and obtain that its value lies between the MA- and AM- complexities of the considered function. Hence the lower bound actually works for a (communication) complexity class between MA/spl cap/co - MA and AM/spl cap/co - AM, and allows to show that the MA-complexity of the disjointness problem is /spl Omega/(/spl radic/n). Following this we consider the conjecture that the lower bound method is polynomially tight for randomized communication complexity. First we disprove a distributional version of this conjecture. Then we give a combinatorial characterization of the value of the lower bound method, in which the optimization over all distributions is absent. This characterization is done by what we call a bounded error uniform threshold cover, and reduces showing tightness of the bound to the construction of an efficient protocol for a specific communication problem. We then study relaxations of bounded error uniform threshold covers, namely approximate majority covers and majority covers, and exhibit exponential separations between them. Each of these covers captures a lower bound method previously used for randomized communication complexity.

[1]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[2]  C. Thomborson,et al.  Area-time complexity for VLSI , 1979, STOC.

[3]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.

[4]  Andrew C. Yao,et al.  Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[5]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[6]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[7]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[8]  Ingo Wegener,et al.  Branching Programs and Binary Decision Diagrams , 1987 .

[9]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[10]  Ran Raz,et al.  Monotone circuits for matching require linear depth , 1990, STOC '90.

[11]  Rüdiger Reischuk,et al.  Relations between Communication Complexity Classes , 1990, J. Comput. Syst. Sci..

[12]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[13]  Michael E. Saks,et al.  Non-Deterministic Communication Complexity with Few Witnesses , 1994, J. Comput. Syst. Sci..

[14]  Juraj Hromkovic,et al.  Nondeterministic communication with a limited number of advice bits , 1996, STOC '96.

[15]  Lane A. Hemaspaandra,et al.  Threshold Computation and Cryptographic Security , 1993, ISAAC.

[16]  Hartmut Klauck,et al.  Lower bounds for computation with limited nondeterminism , 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

[17]  Ran Raz,et al.  Exponential separation of quantum and classical communication complexity , 1999, STOC '99.

[18]  Ziv Bar-Yossef,et al.  An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[19]  Michael E. Saks,et al.  Space lower bounds for distance approximation in the data stream model , 2002, STOC '02.

[20]  Ravi Kumar,et al.  Two applications of information complexity , 2003, STOC '03.

[21]  Hartmut Klauck.  Quantum and Approximate Privacy , 2003, Theory of Computing Systems.