A strong direct product theorem for two-way public coin communication complexity

Details A strong direct product theorem for two-way public coin communication complexity A strong direct product theorem for two-way public coin communication complexity

2010-10-05

arxiv.org/abs/1010.0846v2

Computer Science

Computational Complexity

ver 2, 12 pages, application to set disjointness added

Scientific paper

We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a generalization to non-product distributions of the two-way product subdistribution bound of [J, Klauck and Nayak 08], thereby our result implying their direct product result in terms of the two-way product subdistribution bound. We show that our new complexity measure gives tight lower bound for the set-disjointness problem, as a result we reproduce strong direct product result for this problem, which was previously shown by [Klauck 00].

Affiliated with

Also associated with

No associations

Rating

A strong direct product theorem for two-way public coin communication 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 A strong direct product theorem for two-way public coin communication complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A strong direct product theorem for two-way public coin communication complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-86539