Improved separations between nondeterministic and randomized multiparty communication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5171 LNCS, Issue , 2008, Pages 371-384

  David, Matei ^a   Pitassi, Toniann ^a   Viola, Emanuele ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b Columbia University ^*

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OP-TIMIZATION PROBLEM; MULTI-PARTY COMMUNICATION;

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; LEARNING SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SEPARATION;

APPROXIMATION ALGORITHMS;

EID: 51849137883     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85363-3_30     Document Type: Conference Paper

References (31)

1. Alon, N., Babai, L., Itai, A.: A fast and simple randomized algorithm for the maximal independent set problem. Journal of Algorithms 7, 567-583 (1986)
2. Beame, P., David, M., Pitassi, T., Woelfel, P.: Separating deterministic from nondet, nof multiparty communication complexity. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 134-145. Springer, Heidelberg (2007)
3. Babai, L., Frankl, P., Simon, J.: Complexity classes in communication complexity theory (preliminary version). In: FOCS, pp. 337-347. IEEE, Los Alamitos (1986)
4. Babai, L., Nisan, N., Szegedy, M.: Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. J. Comput. System Sci. 45(2), 204-232 (1992)
5. Boppana, R.B.: The average sensitivity of bounded-depth circuits. Inform. Process. Lett. 63(5), 257-261 (1997)
6. Beame, P., Pitassi, T., Segerlind, N.: Lower bounds for lovász-schrijver systems and beyond follow from multiparty communication complexity. SIAM J. Comput. 37(3), 845-869 (2007)
7. Chattopadhyay, A., Ada, A.: Multiparty communication complexity of disjointness. ECCC, Technical Report TR08-002 (2008)
8. Chandra, A.K., Furst, M.L., Lipton, R.J.: Multi-party protocols. In: STOC (1983)
9. Chor, B., Goldreich, O.: On the power of two-point based sampling. Journal of Complexity 5(1), 96-106 (1989)
10. Chattopadhyay, A.: Discrepancy and the power of bottom fan-in in depth-three circuits. In: FOCS, October 2007, pp. 449-458. IEEE, Los Alamitos (2007)
11. Chung, F.R.K., Tetali, P.: Communication complexity and quasi randomness. SIAM J. Discrete Math. 6(1), 110-123 (1993)
12. Ford, J., Gál, A.: Hadamard tensors and lower bounds on multiparty communication complexity. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1163-1175. Springer, Heidelberg (2005)
13. Gutfreund, D., Viola, E.: Fooling parity tests with parity gates. In: Jansen, K., Khanna, S., Rolim, J., Ron, D. (eds.) RANDOM 2004. LNCS, vol. 3122, pp. 381-392. Springer, Heidelberg (2004)
14. Håstad, J., Goldmann, M.: On the power of small-depth threshold circuits. Comput. Complexity 1(2), 113-129 (1991)
15. Healy, A., Viola, E.: Constant-depth circuits for arithmetic in finite fields of characteristic two. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 672-683. Springer, Heidelberg (2006)
16. Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, Cambridge (1997)
17. Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, Fourier transform, and learnability. J. Assoc. Comput. Mach. 40(3), 607-620 (1993)
18. Lee, T., Shraibman, A.: Disjointness is hard in the multi-party number on the forehead model. In: CCC. IEEE, Los Alamitos (2008)
19. Mansour, Y., Nisan, N., Tiwari, P.: The computational complexity of universal hashing. In: STOC, pp. 235-243. ACM Press, New York (1990)
20. Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. 22(4), 838-856 (1993)
21. Nisan, N., Szegedy, M.: On the degree of boolean functions as real polynomials. Computational Complexity 4, 301-313 (1994)
22. Nisan, N., Wigderson, A.: Rounds in communication complexity revisited. SIAM J. Comput. 22(1), 211-219 (1993)
23. Paturi, R.: On the degree of polynomials that approximate symmetric boolean functions (preliminary version). In: STOC, pp. 468-474. ACM, New York (1992)
24. Razborov, A.A.: Lower bounds on the dimension of schemes of bounded depth in a complete basis containing the logical addition function. Mat. Zametki 41(4), 598-607, 623 (1987)
25. Raz, R.: The BNS-Chung criterion for multi-party communication complexity. Comput. Complexity 9(2), 113-122 (2000)
26. Razborov, A.: Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics 67(1), 145-159 (2003)
27. Ω(logn) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom. Inform. Process. Lett. 45(6), 303-307 (1993)
28. 0 from depth-2 majority circuits. In: STOC 2007: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (2007)
29. Sherstov, A.: The pattern matrix method for lower bounds on quantum communication. In: STOC (2008)
30. Sherstov, A.A.: Communication lower bounds using dual polynomials. Electronic Colloquium on Computational Complexity, Technical Report TR08-057 (2008)
31. Viola, E., Wigderson, A.: Norms, xor lemmas, and lower bounds for GF(2) polynomials and multiparty protocols. In: CCC. IEEE, Los Alamitos (2007); Theory of Computing (to appear)