The Community for Technology Leaders
18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. (2003)
Aarhus, Denmark
July 7, 2003 to July 10, 2003
ISSN: 1093-0159
ISBN: 0-7695-1879-6
pp: 107
Xiaodong Sun , Institute for Advanced Study
Subhash Khot , Princeton University
Xiaodong Sun , Institute for Advanced Study
ABSTRACT
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 size n, we establish a near-optimal lower bound of \Omega (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 \Omega (n/t). These results improve upon the earlier bounds of \Omega (n/t<sup>2</sup>) in the general model, and \Omega \left( {E^2 n/t^{1 + E} } \right) in the one-way model, due to Bar-Yossef, Jayram, Kumar, and Sivakumar [5]. As in the case of earlier results, our bounds apply to the unique intersection promise problem.
INDEX TERMS
null
CITATION

S. Khot, X. Sun, X. Sun, S. Khot and A. Chakrabarti, "Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness," 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.(CCC), Aarhus, Denmark, 2003, pp. 107.
doi:10.1109/CCC.2003.1214414
94 ms
(Ver 3.3 (11022016))