The communication complexity of set-disjointness with small sets and 0-1 intersection

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 63-72

  Kushilevitz, Eyal ^a   Weinreb, Enav ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ADVERSARY ARGUMENT; COMMUNICATION COMPLEXITY; DISJOINTNESS; INDEPENDENT SET; LOWER BOUND TECHNIQUES; LOWER BOUNDS; OPEN PROBLEMS; OTHER APPLICATIONS; RANDOM GRAPHS; SET PROBLEMS;

COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS;

COMMUNICATION;

EID: 77952382184     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.15     Document Type: Conference Paper

References (19)

1. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar, "An information statistics approach to data stream and communication complexity," J. Comput. Syst. Sci., vol. 68, no. 4, pp. 702-732, 2004.
2. A. Beimel, A. Gál, and M. Paterson, "Lower bounds for monotone span programs," Computational Complexity, vol. 6, no. 1, pp. 29-45, 1997, conference version: FOCS '95.
3. J. Edmonds, R. Impagliazzo, S. Rudich, and J. Sgall, "Communication complexity towards lower bounds on circuit depth," Computational Complexity, vol. 10, no. 3, pp. 210-246, 2001.
4. T. Feder, E. Kushilevitz, M. Naor, and N. Nisan, "Amortized communication complexity," SIAM J. Comput., vol. 24, no. 4, pp. 736-750, 1995.
5. A. Gál, "A characterization of span program size and improved lower bounds for monotone span programs," in Proc. of the 30th ACM Symp. on the Theory of Computing, 1998, pp. 429-437.
6. M. Goldmann and J. Håstad, "A simple lower bound for monotone clique using a communication game," Inf. Process. Lett., vol. 41, no. 4, pp. 221-226, 1992.
7. M. Grigni and M. Sipser, "Monotone separation of logarithmic space from logarithmic depth," J. Comput. Syst. Sci., vol. 50, no. 3, pp. 433-437, 1995.
8. J. Håstad and A. Wigderson, "The randomized communication complexity of set disjointness," Theory of Computing, vol. 3, no. 1, pp. 211-219, 2007.
9. B. Kalyanasundaram and G. Schintger, "The probabilistic communication complexity of set intersection," SIAM Journal on Discrete Mathematics, vol. 5, no. 4, pp. 545-557, 1992.
10. M. Karchmer and A. Wigderson, "Monotone circuits for connectivity require super-logarithmic depth," in Proc. of the 20th ACM Symp. on the Theory of Computing, 1988, pp. 539-550.
11. E. Kushilevitz and E.Weinreb, "On the complexity of communication complexity," in Proc. of the 41st ACM Symp. on the Theory of Computing, 2009, pp. 465-474.
12. E. Kushilevitz, N. Linial, and R. Ostrovsky, "The linear-array conjecture in communication complexity is false," Combina-torica, vol. 19, no. 2, pp. 241-254, 1999.
13. E. Kushilevitz and N. Nisan, Communication Complexity. Cambridge University Press, 1997.
14. K. Mehlhorn and E. M. Schmidt, "Las vegas is better than determinism in VLSI and distributed computing," in Proc. of the 14th ACM Symp. on the Theory of Computing, 1982, pp. 330-337.
15. N. Nisan and A. Wigderson, "On rank vs. communication complexity," Combinatorica, vol. 15, no. 4, pp. 557-565, 1995.
16. A. A. Razborov, "Applications of matrix methods to the theory of lower bounds in computational complexity," Com-binatorica, vol. 10, no. 1, pp. 81-93, 1990.
17. -, "On the distributional complexity of disjointness," Theor. Comput. Sci., vol. 106, no. 2, pp. 385-390, 1992.
18. M. Yannakakis, "Expressing combinatorial optimization problems by linear programs," J. Comput. Syst. Sci., vol. 43, no. 3, pp. 441-466, 1991.
19. A. C. Yao, "Some complexity questions related to distributed computing," in Proc. of the 11th ACM Symp. on the Theory of Computing, 1979, pp. 209-213.