Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/inria-00359840
Contributor : Publications Loria <>
Submitted on : Monday, February 9, 2009 - 2:55:33 PM
Last modification on : Friday, February 13, 2009 - 12:04:15 PM
Long-term archiving on: : Tuesday, June 8, 2010 - 10:07:40 PM

Files

gronemeier_new.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00359840, version 1
  • ARXIV : 0902.1609

Collections

Citation

André Gronemeier. Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.505-516. ⟨inria-00359840⟩

Share

Metrics

Record views

76

Files downloads

127