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
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;
Conference_Titel :
Computational Complexity, 2005. Proceedings. Twentieth Annual IEEE Conference on
Print_ISBN :
0-7695-2364-1
