Near-optimal lower bounds on the multi-party communication complexity of set disjointness

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2003, Pages 107-117

  Chakrabarti, Amit ^a   Khot, Subhash ^b   Sun, Xiaodong ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; INTEGER PROGRAMMING; COMPUTER SCIENCE; COST FUNCTIONS; FUNCTIONS; INFORMATION THEORY; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; NETWORK PROTOCOLS; PROBES; SUN;

DATA SETS;

COMPUTATIONAL COMPLEXITY;

BOOKS; COMMUNICATION COMPLEXITY; COMMUNICATION MODELING; COMMUNICATION PROBLEMS; COMPLEXITY THEORY; FREQUENCY; MULTI-PARTY COMMUNICATION; SET DISJOINTNESS PROBLEMS;

EID: 0041513338     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. F. Ablayev. Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science, 175(2):139-159, 1996.
2. M. Ajtai, T. Jayram, R. Kumar, and D. Sivakumar. Approximate counting of inversions in a data stream. In STOC, pages 370-379, 2002.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In STOC, pages 20-29, 1996.
4. L. Babai. Communication complexity. Technical Report TR-2001-09, University of Chicago, 2001.
5. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. In Proc. 43rd Annu. IEEE Symp. Found. Comp. Sci., pages 209-218, 2002.
6. A. Chakrabarti, Y. Shi, A. Wirth, and A. C. Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In Proc. 42nd Annu. IEEE Symp. Found. Comp. Sci., pages 270-278, 2001.
7. T. Cover and J. Thomas. Elements of Information Theory. John Wiley & Sons, 1991.
8. J. Håstad and A. Wigderson. The probabilistic communication complexity of disjointness of k-sets is O(k). Unpublished manuscript, 1990.
9. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In FOCS, pages 189-197, 2000.
10. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, Cambridge, 1997.
11. I. Newman. Private vs. common random bits in communication complexity. Information Processing Letters, 39(2):67-71, 1991.
12. M. Saks and X. Sun. Space lower bounds for distance approximation in the data stream model. In Proc. 34th Annu. ACM Symp. Theory Comput., pages 360-369, 2002.
13. A. C. Yao. Some complexity questions related to distributive computing. In Proc. 11th Annu. ACM Symp. Theory Comput., pages 209-213, 1979.