The Partition Bound for Classical Communication Complexity and Query Complexity

@article{Jain2010ThePB,
  title={The Partition Bound for Classical Communication Complexity and Query Complexity},
  author={Rahul Jain and Hartmut Klauck},
  journal={2010 IEEE 25th Annual Conference on Computational Complexity},
  year={2010},
  pages={247-258}
}
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… CONTINUE READING
Highly Cited
This paper has 102 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 63 extracted citations

102 Citations

0102030'11'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 102 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…