Separating AC0 from depth-2 majority circuits

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 294-301

  Sherstov, Alexander A ^a  

^a University of Texas at Austin   (United States)

Author keywords

AC0; Communication complexity; Discrepancy; Threshold circuits

Indexed keywords

BOOLEAN FUNCTIONS; CIRCUIT SIMULATION; COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

COMMUNICATION COMPLEXITY; DISCREPANCY THEOREM; LEARNING THEORY; THRESHOLD CIRCUITS;

NETWORKS (CIRCUITS);

EID: 35448959277     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250834     Document Type: Conference Paper

References (24)

1. E. Allender. A note on the power of threshold circuits. In FOCS, pages 580-584, 1989.
2. J. Aspnes, R. Beigel, M. Furst, and S. Rudich. The expressive power of voting polynomials. In STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of computing, pages 402-409, New York, NY, USA, 1991. ACM Press.
3. H. Buhrman, N. K. Vereshchagin, and R. de Wolf. On computation and communication with, small bias. In 22nd IEEE Conference on Computational Complexity, 2007.
4. J. Ford and A. Gal. Hadamard tensors and lower bounds on multiparty communication complexity. In ICALP, pages 1163-1175, 2005.
5. J. Forster, M. Krause, S. V. Lokam, R. Mubarakzjanov, N. Schmitt, and H.-U. Simon. Relations between communication complexity, linear arrangements, and computational complexity. In FSTTCS '01: Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science, pages 171-182, London, UK, 2001. Springer-Verlag.
6. M. Goldmann, J. Håstad, and A. A. Razborov. Majority gates vs. general weighted threshold gates. Computational Complexity, 2:277-300, 1992.
7. M. Goldmann and M. Karpinski. Simulating threshold circuits by majority circuits. SIAM J. Comput., 27(1):230-246, 1998.
8. 1/3) In STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 258-265, New York, NY, USA, 2001. ACM Press.
9. A. R. Klivans and R. A. Servedio. Learning intersections of halfspaces with a margin. In COLT, pages 348-362, 2004.
10. A. R. Klivans and A. A. Sherstov. Improved lower bounds for learning intersections of halfspaces. In Proceedings of the 19th Annual Conference on Learning Theory (COLT), Pittsburg, USA, June 2006.
11. M. Krause and P. Pudlák. On the computational power of depth 2 circuits with threshold and modulo gates. In STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, pages 48-57, New York, NY, USA, 1994. ACM Press.
12. M. Krause and P. Pudlák. Computing Boolean functions by polynomials and threshold circuits. Comput. Complex., 7(4):346-370, 1998.
13. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, New York, NY, USA, 1997.
14. N. Linial and A. Shraibman. Lower bounds in communication complexity based on factorization norms. Manuscript at http://www.cs.huji.ac.il/~nati/ PAPERS/quant_cc.pdf, June 2006.
15. M. L. Minsky and S. A. Papert. Perceptrons: expanded edition. MIT Press, Cambridge, MA, USA, 1988.
16. N. Nisan. The communication complexity of threshold gates. In Proceedings of "Combinatorics, Paul Erdos is Eighty", pages 301-315, 1993.
17. A. B. J. Novikoff. On convergence proofs on perceptrons. In Proceedings of the Symposium on the Mathematical Theory of Automata, volume XII, pages 615-622, 1962.
18. R. O'Donnell and R. A. Servedio. Extremal properties of polynomial threshold functions. In IEEE Conference on Computational Complexity, pages 3-12, 2003.
19. R. O'Donnell and R. A. Servedio. New degree bounds for polynomial threshold functions. In STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 325-334, New York, NY, USA, 2003. ACM Press.
20. R. Paturi and J. Simon. Probabilistic communication complexity. J. Comput. Syst. Sci., 33(1):106-123, 1986.
21. R. Raz. The BNS-Chung criterion for multi-party communication complexity. Comput. Complex., 9(2): 113-122, 2000.
22. A. A. Razborov. On the distributional complexity of disjointness. Theor. Comput. Sci., 106(2):385-390, 1992.
23. A. Schrijver. Theory of linear and integer programming. John Wiley & Sons, Inc., New York, NY, USA, 1998.
24. K.-Y. Siu and V. P. Roychowdhury. On optimal, depth threshold circuits for multiplication and related problems. SIAM J. Discrete Math., 7(2):284-292, 1994.