The Partition Bound for Classical Communication Complexity and Query Complexity

Details The Partition Bound for Classical Communication Complexity and Query Complexity The Partition Bound for Classical Communication Complexity and Query Complexity

2009-10-22

arxiv.org/abs/0910.4266v2

Computer Science

Computational Complexity

28 pages, ver. 2, added content

Scientific paper

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 \gamma_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 polynomial degree and classical adversary bounds.

Affiliated with

Also associated with

No associations

Rating

The Partition Bound for Classical Communication Complexity and Query Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Partition Bound for Classical Communication Complexity and Query Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Partition Bound for Classical Communication Complexity and Query Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-690402