A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness

P Beame,N Segerlind,T Pitassi,A Wigderson

doi:10.1109/ccc.2005.1

A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness

P Beame, N Segerlind + Show 2 more

https://doi.org/10.1109/ccc.2005.1

Copy DOI

Publication Date: Jun 11, 2005

Citations: 48

Affiliation: Seattle University, University of Washington, University of Toronto, Institute for Advanced Study

#Communication Complexity Of Set Disjointness #Direct Sum + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

We prove that corruption, one of the most powerful measures used to analyze 2-party randomized communication complexity, satisfies a strong direct sum property under rectangular distributions. This direct sum bound holds even when the error is allowed to be exponentially close to 1. We use this to analyze the complexity of the widely-studied set disjointness problem in the usual number-on-the-forehead (NOF) model of multiparty communication complexity.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.