On the complexity of communication complexity

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 465-473

  Kushilevitz, Eyal ^a   Weinreb, Enav ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Communication complexity; Hardness of approximations; Lower bounds; Protocol tree; Pseudo random functions

Indexed keywords

COMMUNICATION COMPLEXITY; HARDNESS OF APPROXIMATIONS; LOWER BOUNDS; PROTOCOL TREE; PSEUDO RANDOM FUNCTIONS;

BOOLEAN FUNCTIONS; COMMUNICATION; COMPUTER SCIENCE; CONTROL THEORY; HARDNESS;

COMPUTATIONAL COMPLEXITY;

EID: 70350694428     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536479     Document Type: Conference Paper

References (25)

1. S. Aaronson and A. Wigderson. Algebrization: a new barrier in complexity theory. In Proc. of the 40th ACM Symp. on the Theory of Computing, pages 731-740, 2008.
2. A. Aho, J. Ullman, and M. Yannanakakis. On notations of information transfer in vlsi circuits. In Proc. of the 15th ACM Symp. on the Theory of Computing, pages 133-139, 1983.
3. O. Barkol, Y. Ishai, and E. Weinreb. Communication in the presence of replication. In STOC, pages 661-670, 2008.
4. M. Goldmann and J. Håstad. A simple lower bound for monotone clique using a communication game. Inf. Process. Lett., 41(4):221-226, 1992.
5. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. J. of the ACM, 33(4):792-807, 1986.
6. S. Jukna. On graph complexity. Electronic Colloquium on Computational Complexity (ECCC), 2004.
7. V. Kabanets and J. Cai. Circuit minimization problem. In STOC, pages 73-79, 2000.
8. 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, pages 539-550, 1988.
9. H. Klauck. Rectangle size bounds and threshold covers in communication complexity. In IEEE Conference on Computational Complexity, pages 118-134, 2003.
10. E. Kushilevitz, N. Linial, and R. Ostrovsky. The linear-array conjecture in communication complexity is false. Combinatorica, 19(2):241-254, 1999.
11. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
12. S. V. Lokam. Remarks on graph complexity. In FSTTCS, pages 307-318, 1998.
13. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. J. of the ACM, 41(5):960-981, 1994.
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, pages 330-337, 1982.
15. M. Naor and O. Reingold. Number-theoretic constructions of efficient pseudo-random functions. J. ACM, 51(2):231-262, 2004.
16. N. Nisan and A. Wigderson. On rank vs. communication complexity. Combinatorica, 15(4):557-565, 1995.
17. J. Orlin. Contentment in graph theory: Covering graphs with cliques. In Nederl. Akad. Wet., Proc., pages 406-424, 1977.
18. P. Pudlák, V. Rödl, and P. Savický. Graph complexity. Acta Inf., 25(5):515-535, 1988.
19. R. Raz and B. Spieker. On the "log rank"-conjecture in communication complexity. Combinatorica, 15(4):567-588, 1995.
20. R. Raz and A. Wigderson. Monotone circuits for matching require linear depth. J. of the ACM, 39:736-744, 1992.
21. A. A. Razborov and S. Rudich. Natural proofs. J. Comput. Syst. Sci., 55(1):24-35, 1997.
22. R. Roth. Introduction to Coding Theory. Cambridge University Press, New York, NY, USA, 2006.
23. C. E. Shannon. The synthesis of two terminal switching circuits. Bell System Technical Journal, 28:59-98, 1949.
24. M. Yannakakis. Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci., 43(3):441-466, 1991.
25. A.C. Yao. Some complexity questions related to distributed computing. In Proc. of the 11th ACM Symp. on the Theory of Computing, pages 209-213, 1979.