The Partition Bound for Classical Communication Complexity and Query Complexity

We describe new lower bounds for randomized communication complexity and query complexity which we call the partition bounds. They are expressed as the optimum value of linear programs. For communication complexity we show that the partition bound is stronger than both the rectangle/corruption bound and the γ2/generalized discrepancy bounds. In the model of query complexity we show that the partition bound is stronger than the approximate polynomial degree and classical adversary bounds. We also exhibit an example where the partition bound is quadratically larger than the approximate polynomial degree and adversary bounds.

[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]  Alexander A. Sherstov.  The pattern matrix method for lower bounds on quantum communication , 2008, STOC '08.

[3]  Nathan Linial,et al.  Learning Complexity vs. Communication Complexity , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

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

[5]  Andris Ambainis,et al.  Quantum lower bounds by quantum arguments , 2000, STOC '00.

[6]  Scott Aaronson,et al.  Lower bounds for local search by quantum arguments , 2003, STOC '04.

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

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

[9]  Frédéric Magniez,et al.  Lower bounds for randomized and quantum query complexity using Kolmogorov arguments , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[10]  Eyal Kushilevitz,et al.  Fractional covers and communication complexity , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[11]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 2001, JACM.

[12]  H. Buhrman,et al.  Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..

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

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

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

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

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

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

[19]  Troy Lee,et al.  Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model , 2008, Computational Complexity Conference.

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

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

[22]  Michael E. Saks,et al.  Probabilistic Boolean decision trees and the complexity of evaluating game trees , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[23]  Scott Aaronson,et al.  Quantum certificate complexity , 2002, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[24]  Noam Nisan,et al.  CREW PRAMS and decision trees , 1989, STOC '89.

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

[26]  Jaikumar Radhakrishnan,et al.  A lower bound for the bounded round quantum communication complexity of set disjointness , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

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

[28]  Hartmut Klauck.  A strong direct product theorem for disjointness , 2010, STOC '10.

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

[30]  Noam Nisan,et al.  On rank vs. communication complexity , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[31]  Troy Lee,et al.  Negative weights make adversaries stronger , 2007, STOC '07.

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

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

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

[35]  Mario Szegedy,et al.  All Quantum Adversary Methods Are Equivalent , 2005, ICALP.