Multiparty communication complexity and threshold circuit size of AC 0

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

Volumn , Issue , 2009, Pages 53-62

  Beame, Paul ^a   Huynh Ngoc, Dang Trinh ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Communication complexity; Constant depth circuits; Lower bounds

Indexed keywords

COMMUNICATION COMPLEXITY; CONSTANT-DEPTH CIRCUITS; DEPTH 3; DEPTH 4; DISJOINTNESS; LOWER BOUNDS; MULTIPARTY COMMUNICATION COMPLEXITY; NON-TRIVIAL; QUASI-POLY-NOMIAL; THRESHOLD CIRCUITS;

COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS;

COMMUNICATION;

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

References (27)

1. E. W. Allender, "A note on the power of threshold circuits," in 30th Annual Symposium on Foundations of Computer Science. Research Triangle Park, NC: IEEE, Oct. 1989, pp. 580-584.
2. L. Babai, A. Gál, P. G. Kimmel, and S. V. Lokam, "Communication complexity of simultaneous messages," SIAM Journal on Computing, vol. 33, no. 1, pp. 137-166, 2003.
3. L. Babai, T. P. Hayes, and P. G. Kimmel, "The cost of the missing bit: Communication complexity with help," Combinatorica, vol. 21, no. 4, pp. 455-488, 2001.
4. L. Babai, N. Nisan, and M. Szegedy, "Multiparty protocols, pseudorandom generators for logspace, and time-space tradeoffs," Journal of Computer and System Sciences, vol. 45, no. 2, pp. 204-232, Oct. 1992.
5. P. Beame, T. Pitassi, N. Segerlind, and A. Wigderson, "A strong direct product theorem for corruption and the multiparty communication complexity of set disjointness," Computational Complexity, vol. 15, no. 4, pp. 391-432, 2006.
6. A. Ben-Aroya, O. Regev, and R. de Wolf, "A hypercontractive inequality for matrix-valued functions with applications to quantum computing," in Proceedings 49th Annual Symposium on Foundations of Computer Science. Philadelphia, PA: IEEE, Oct. 2008, pp. 477-486.
7. A. Chattopadhyay, "Discrepancy and the power of bottom fan-in in depth-three circuits," in Proceedings 48th Annual Symposium on Foundations of Computer Science. Berkeley, CA: IEEE, Oct. 2007, pp. 449-458.
8. A. Chattopadhyay and A. Ada, "Multiparty communication complexity of disjointness," Electronic Colloquium in Computation Complexity, Tech. Rep. TR08-002, 2008.
9. F. R. K. Chung, "Quasi-random classes of hypergraphs," Random Structures and Algorithms, vol. 1, no. 4, pp. 363-382, 1990.
10. M. David, T. Pitassi, and E. Viola, "Improved separations between nondeterministic and randomized multiparty communication," in RANDOM 2008, 12th International Workshop on Randomization and Approximization Techniques in Computer Science, 2008, pp. 371-384.
11. J. Håstad and M. Goldmann, "On the power of small-depth threshold circuits," Computational Complexity, vol. 1, pp. 113-129, 1991.
12. R. Jain, H. Klauck, and A. Nayak, "Direct product theorems for classical communication complexity via subdistribution bounds," in Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, Victoria, BC, May 2008, pp. 599-608.
13. E. Kushilevitz and N. Nisan, Communication Complexity. Cambridge, England; New York: Cambridge University Press, 1997.
14. T. Lee and A. Shraibman, "Disjointness is hard in the multi-party number-on-the-forehead model," in Proceedings Twenty-Third Annual IEEE Conference on Computational Complexity, College Park, Maryland, Jun. 2008, pp. 81-91.
15. M. Linial, Y. Mansour, and N. Nisan, "Constant depth circuits, Fourier transform, and learnability," in 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, Oct. 1989, pp. 574-579.
16. N. Nisan and M. Szegedy, "On the degree of boolean functions as real polynomials," Computational Complexity, vol. 4, pp. 301-314, 1994.
17. R. Raz, "The BNS-Chung criterion for multi-party communication complexity," Computational Complexity, vol. 9, pp. 113-122, 2000.
18. A. Razborov and A. Wigderson, "Lower bounds on the size of depth 3 threshold circuits with AND gates at the bottom," Information Processing Letters, vol. 45, pp. 303-307, 1993.
19. 0," in Proceedings 49th Annual Symposium on Foundations of Computer Science. Philadelphia, PA: IEEE, Oct. 2008, pp. 57-66.
20. 0 from depth-2 majority circuits," in Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, San Diego, CA, Jun. 2007, pp. 294-301.
21. -, "Communication lower bounds using dual polynomials," Bulletin of the European Association for Theoretical Computer Science, vol. 95, pp. 59-93, 2008.
22. -, "The pattern matrix method for lower bounds on quantum communication," in Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, Victoria, BC, May 2008, pp. 85-94.
23. -, "Unbounded-error communication complexity of symmetric functions," in Proceedings 49th Annual Symposium on Foundations of Computer Science. Philadelphia, PA: IEEE, Oct. 2008, pp. 384-393.
24. P. Tesson, "Communication complexity questions related to finite monoids and semigroups," Ph.D. dissertation, McGill University, 2002.
25. E. Viola, "Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gates," SIAM Journal on Computing, vol. 36, no. 5, pp. 1387-1403, 2007. (Pubitemid 47632452)
26. E. Viola and A. Wigderson, "One-way multi-party communication lower bound for pointer jumping with applications," in Proceedings 48th Annual Symposium on Foundations of Computer Science. Berkeley, CA: IEEE, Oct. 2007, pp. 427-437.
27. A. C. Yao, "On ACC and threshold circuits," in Proceedings 31st Annual Symposium on Foundations of Computer Science. St. Louis, MO: IEEE, Oct. 1990, pp. 619-627.