A strong direct product theorem for disjointness

A strong direct product theorem states that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then the overall success probability will be exponentially small in k. We establish such a theorem for the randomized communication complexity of the Disjointness problem, i.e., with communication const• kn the success probability of solving k instances of size n can only be exponentially small in k. This solves an open problem of [KSW07, LSS08]. We also show that this bound even holds for $AM$-communication protocols with limited ambiguity. The main result implies a new lower bound for Disjointness in a restricted 3-player NOF protocol, and optimal communication-space tradeoffs for Boolean matrix product. Our main result follows from a solution to the dual of a linear programming problem, whose feasibility comes from a so-called Intersection Sampling Lemma that generalizes a result by Razborov [Raz92].

[1]  Hartmut Klauck,et al.  Rectangle size bounds and threshold covers in communication complexity , 2002, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[2]  Hartmut Klauck,et al.  Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs , 2007, SIAM J. Comput..

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

[4]  Ran Raz,et al.  Direct product results and the GCD problem, in old and new communication models , 1997, STOC '97.

[5]  Alexander A. Sherstov.  The pattern matrix method for lower bounds on quantum communication , 2008, STOC '08.

[6]  Ronald de Wolf,et al.  A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs , 2007, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Martin Tompa,et al.  Communication-Space Tradeoffs for Unrestricted Protocols , 1994, SIAM J. Comput..

[8]  Avi Wigderson,et al.  Uniform direct product theorems: simplified, optimized, and derandomized , 2008, SIAM J. Comput..

[9]  Xi Chen,et al.  How to compress interactive communication , 2010, STOC '10.

[10]  Karl R. Abrahamson.  A time-space tradeoff for Boolean matrix multiplication , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

[12]  Hartmut Klauck.  Lower Bounds for Quantum Communication Complexity , 2007, SIAM J. Comput..

[13]  Hartmut Klauck,et al.  The Partition Bound for Classical Communication Complexity and Query Complexity , 2009, 2010 IEEE 25th Annual Conference on Computational Complexity.

[14]  Andris Ambainis,et al.  Quantum search of spatial regions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[15]  Troy Lee,et al.  Disjointness is Hard in the Multiparty Number-on-the-Forehead Model , 2007, 2008 23rd Annual IEEE Conference on Computational Complexity.

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

[17]  Nathan Linial,et al.  Lower bounds in communication complexity based on factorization norms , 2007, STOC '07.

[18]  Andris Ambainis,et al.  A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs , 2005, STOC '06.

[19]  Hartmut Klauck,et al.  Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract , 2008, STOC.

[20]  A. Razborov.  Communication Complexity , 2011 .

[21]  Hartmut Klauck.  Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds , 2004, FSTTCS.

[22]  A. Razborov.  Quantum communication complexity of symmetric predicates , 2002, quant-ph/0204025.

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

[24]  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..

[25]  Tak Wah Lam,et al.  Trade-Offs between Communication and Space , 1992, J. Comput. Syst. Sci..

[26]  Ronen Shaltiel.  Towards proving strong direct product theorems , 2003, computational complexity.

[27]  Emanuele Viola,et al.  Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols , 2008, Theory Comput..

[28]  Andris Ambainis,et al.  A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs , 2006, STOC.

[29]  Troy Lee,et al.  A Direct Product Theorem for Discrepancy , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[30]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[31]  Michael E. Saks,et al.  Products and help bits in decision trees , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[32]  Arkadev Chattopadhyay,et al.  Multiparty Communication Complexity of Disjointness , 2008, Electron. Colloquium Comput. Complex..

[33]  A. S.  The Pattern Matrix Method for Lower Bounds on Quantum Communication ∗ , 2007 .

[34]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 1992, STOC '92.

[35]  Avi Wigderson,et al.  A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness , 2006, computational complexity.

[36]  Emanuele Viola,et al.  One-way multiparty communication lower bound for pointer jumping with applications , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

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

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

[39]  Eyal Kushilevitz,et al.  Fractional Covers and Communication Complexity , 1995, SIAM J. Discret. Math..

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

[41]  Falk Unger,et al.  A Probabilistic Inequality with Applications to Threshold Direct-Product Theorems , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.