Disjointness is hard in the multi-party number-on-the-forehead model

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2008, Pages 81-91

  Lee, Troy ^a   Shraibman, Adi ^b  

^a RUTGERS UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DISJOINTNESS;

COMPUTATIONAL COMPLEXITY;

EID: 51749099617     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2008.29     Document Type: Conference Paper

References (25)

1. H. Abelson. Lower bounds on information transfer in distributed computations. In Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, pages 151-158. IEEE, 1978.
2. L. Babai, T. Hayes, and P. Kimmel. The cost of the missing bit: communication complexity with help. Combinatorica, 21:455-488, 2001.
3. L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols and Logspace-hard pseudorandom sequences. In Proceedings of the 21st ACM Symposium on the Theory of Computing, pages 1-11. ACM, 1989.
4. P. Beame, T. Pitassi, and N. Segerlind. Lower bounds for Lov́ asz-Schrijver systems and beyond follow from multiparty communication complexity. SIAM Journal on Computing, 37(3):845-869, 2006.
5. P. Beame, T. Pitassi, N. Segerlind, and A. Wigderson. A strong direct product lemma for corruption and the NOF complexity of disjointness. Computational Complexity, 15(4):391-432, 2006.
6. A. Chandra, M. Furst, and R. Lipton. Multi-party protocols. In Proceedings of the 15th ACM Symposium on the Theory of Computing, pages 94-99. ACM, 1983.
7. A. Chattopadhyay. Discrepancy and the power of bottom fan-in depth-three circuits. In Proceedings of the 48th IEEE Symposium on Foundations of Computer Science, pages 449-458. IEEE, 2007.
8. A. Chattopadhyay and A. Ada. Multiparty communication complexity of disjointness. Technical Report TR-08-002, ECCC, 2008.
9. M. David and T. Pitassi. Separating nof communication classes RP and NP. Technical Report TR-08-014, ECCC, 2008.
10. J. Ford and A. Gál. Hadamard tensors and lower bounds on multiparty communication complexity. In Proceedings of the 32th International Colloquium On Automata, Languages and Programming, pages 1163-1175, 2005.
11. M. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:1115-1145, 1995.
12. V. Grolmusz. The BNS lower bound for multi-party protocols is nearly optimal. Information and computation, 112(1):51-54, 1994.
13. J. Håstad and M. Goldmann. On the power of small-depth threshold circuits. Computational Complexity, 1:113-129, 1991.
14. D. Itsykson and A. Kojevnikov. Lower bounds of static Lovász-Schrijver calculus proofs for Tseitin tautologies. Zapiski Nauchnyh Seminarov POMI, 340:10-32, 2006.
15. B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection. In Proceedings of the 2nd Annual Conference on Structure in Complexity Theory, pages 41-49, 1987.
16. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
17. N. Linial and A. Shraibman. Lower bounds in communication complexity based on factorization norms. In Proceedings of the 39th ACM Symposium on the Theory of Computing. ACM, 2007.
18. L. Lovász and A. Schrijver. Cones of matrices and set-functions, and 0-1 optimization. SIAM Journal of Optimization, 1:1-17, 1991.
19. A. Razborov. On the distributional complexity of disjointness. Theoretical Computer Science, 106:385-390, 1992.
20. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics, 67(1):145-159, 2003.
21. 0 from depth-2 majority circuits. In Proceedings of the 39th ACM Symposium on the Theory of Computing. ACM, 2007.
22. A. Sherstov. The pattern matrix method for lower bounds on quantum communication. In Proceedings of the 40th ACM Symposium on the Theory of Computing. ACM, 2008.
23. P. Tesson. Communication complexity questions related to finite monoids and semigroups. PhD thesis, McGill University, 2002.
24. A. Yao. On some complexity questions in distributive computing. In Proceedings of the 11th ACM Symposium on the Theory of Computing, pages 209-213. ACM, 1979.
25. A. Yao. On ACC and threshold circuits. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pages 619-627. IEEE, 1990.