The Partition Bound for Classical Communication Complexity and Query Complexity

Authors:
Rahul Jain;Hartmut Klauck
Affiliations:
-;-
Venue:
CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
Year:
2010

Citing 0
Cited 3

Quantum one-way communication can be exponentially stronger than classical communication

Proceedings of the forty-third annual ACM symposium on Theory of computing
An optimal lower bound on the communication complexity of gap-hamming-distance

Proceedings of the forty-third annual ACM symposium on Theory of computing
Classical and quantum partition bound and detector inefficiency

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.