Sciweavers

Share
STACS
2009
Springer

Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness

10 years 6 months ago
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special case of the well known disjointness problem, and the ANDk-function in the number in the hand model. Our Ω(n/k) bound for disjointness improves on an earlier Ω(n/(k log k)) bound by Chakrabarti et al. (2003), who obtained an asymptotically tight lower bound for one-way protocols, but failed to do so for the general case. Our result eliminates both the gap between the upper and the lower bound for unrestricted protocols and the gap between the lower bounds for one-way protocols and unrestricted protocols.
Andre Gronemeier
Added 27 Jul 2010
Updated 27 Jul 2010
Type Conference
Year 2009
Where STACS
Authors Andre Gronemeier
Comments (0)
books