Sciweavers

CORR
2008
Springer

Multiparty Communication Complexity of Disjointness

13 years 10 months ago
Multiparty Communication Complexity of Disjointness
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of multiparty communication. In particular, this yields a bound of n(1) when k is a constant. The previous best lower bound for three players until recently was (log n). Our bound separates the communication complexity classes NPCC k and BPPCC k for k = o(log log n). Furthermore, by the results of Beame, Pitassi and Segerlind [4], our bound implies proof size lower bounds for tree-like, degree k - 1 threshold systems and superpolynomial size lower bounds for Lov
Arkadev Chattopadhyay, Anil Ada
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Arkadev Chattopadhyay, Anil Ada
Comments (0)