Sciweavers

Share
CORR
2010
Springer

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

9 years 1 months ago
A strong direct product theorem for two-way public coin communication complexity
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 [JKN08], thereby our result implying their direct product result in terms of the two-way product subdistribution bound.
Rahul Jain
Added 14 May 2011
Updated 14 May 2011
Type Journal
Year 2010
Where CORR
Authors Rahul Jain
Comments (0)
books