DocumentCode
3379436
Title
A direct sum theorem for corruption and the multiparty NOF communication complexity of set disjointness
Author
Beame, Paul ; Pitassi, Toniann ; Segerlind, Nathan ; Wigderson, Avi
Author_Institution
Washington Univ., Seattle, WA, USA
fYear
2005
fDate
11-15 June 2005
Firstpage
52
Lastpage
66
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.
Keywords
communication complexity; randomised algorithms; set theory; 2-party randomized communication complexity; direct sum bound; direct sum property; direct sum theorem; multiparty NOF communication complexity; number-on-the-forehead model; rectangular distribution; set disjointness problem; Broadcasting; Complexity theory; Computational complexity; Forehead; Frequency; Protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity, 2005. Proceedings. Twentieth Annual IEEE Conference on
ISSN
1093-0159
Print_ISBN
0-7695-2364-1
Type
conf
DOI
10.1109/CCC.2005.1
Filename
1443073
Link To Document