TY - JOUR
T1 - A direct sum theorem for corruption and the multiparty nof communication complexity of set disjointness
AU - Beame, Paul
AU - Pitassi, Toniann
AU - Segerlind, Nathan
AU - Wigderson, Avi
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=27644517803&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:27644517803
SN - 1093-0159
SP - 52
EP - 66
JO - Proceedings of the Annual IEEE Conference on Computational Complexity
JF - Proceedings of the Annual IEEE Conference on Computational Complexity
T2 - 20th Annual IEEE Conference on Computational Complexity
Y2 - 11 June 2005 through 15 June 2005
ER -