Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness

@inproceedings{Chakrabarti2003NearOptimalLB,
  title={Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness},
  author={Amit Chakrabarti and Subhash Khot and Xiaodong Sun},
  booktitle={IEEE Conference on Computational Complexity},
  year={2003}
}
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of sizen, we establish a near-optimal lower bound of Ω(n/(t log t)) on the communication complexity of the problem of determining whether their sets are disjoint. In the more restrictive one-way communication model, in which the players are required to speak in a predetermined order, we improve our bound to an optimalΩ(n/t). These results… CONTINUE READING
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 201 citations. REVIEW CITATIONS
131 Citations
13 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 131 extracted citations

202 Citations

0102030'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 202 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

The probabilistic communication complexity of disjointness of k-sets is O(k)

  • J. Håstad, A. Wigderson
  • Unpublished manuscript,
  • 1990
Highly Influential
5 Excerpts

Communication complexity. Technical Report TR-2001-09

  • L. Babai
  • University of Chicago,
  • 2001
1 Excerpt

Nisan.Communication Complexity

  • N. E. Kushilevitz
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…