A direct sum theorem in communication complexity via message compression

@inproceedings{Jain2003ADS,
  title={A direct sum theorem in communication complexity via message compression},
  author={Rahul Jain and Jaikumar Radhakrishnan and Pranab Sen},
  booktitle={ICALP},
  year={2003}
}
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a protocol, as defined by Chakrabarti et al. [CSWY01] and refined further by Bar-Yossef et al. [BJKS02]. Our main technical result is a ‘compression’ theorem saying that, for any probability distribution over the inputs, a -round private coin bounded error protocol for a function with information cost can be converted… CONTINUE READING
Highly Cited
This paper has 98 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
63 Citations
17 References
Similar Papers

Citations

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

98 Citations

051015'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 98 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…