The sign-rank of AC0

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

Volumn , Issue , 2008, Pages 57-66

  Razborov, Alexander A ^a,b   Sherstov, Alexander A ^c  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^c University of Texas at Austin

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; FIBER OPTIC CHEMICAL SENSORS; FUNCTIONS; PROBABILITY DENSITY FUNCTION;

DNF FORMULAS; LEARNING THEORIES; LOWER BOUNDS; OPEN PROBLEMS; POLYNOMIAL SIZES; REAL MATRIXES; UPPER BOUNDS;

CONTROL THEORY;

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

References (35)

1. M. Alekhnovich, M. Braverman, V. Feldman, A. R. Klivans, and T. Pitassi. Learnability and automatizability. In FOCS 2004.
2. N. Alon, P. Frankl, and V. Rödl. Geometrical, realization of set systems and probabilistic communication complexity. In FOCS 1985.
3. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In FOCS 1986.
4. S. Ben-David, N. Eiron, and H. U. Simon. Limitations of learning via embeddings in Euclidean half spaces. J. Mach. Learn. Res., 3:441-461, 2003.
5. N. H. Bshouty. A subexponential exact learning algorithm for DNF using equivalence queries. Inf. Process. Lett., 59(1):37-39, 1996.
6. H. Buhrman, N. K. Vereshchagin, and R. de Wolf. On computation and communication with small bias. In CCC 2007.
7. E. W. Cheney. Introduction to Approximation Theory. Chelsea Publishing, New York, 2nd edition, 1982.
8. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput, 17(2):230-261, 1988.
9. J. Forster. A linear lower bound on the unbounded error probabilistic communication complexity. J. Comput. Syst. Sci., 65(4):612-625, 2002.
10. 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 Proc. of the 21st Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 171-182, 2001.
11. J. Forster and H. U. Simon. On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes. Theor. Comput. Sci., 350(1):40-48, 2006.
12. S. Jukna. On graph complexity. Combinatorics, Probability and Computing, 15:1-22, 2006.
13. M. Kearns. Efficient noise-tolerant learning from statistical queries. In STOC 1993.
14. M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning Theory. MIT Press, Cambridge, 1994.
15. M. Kharitonov. Cryptographic hardness of distributionspecific learning. In STOC 1993.
16. H.Klauck. Lower bounds for quantum communication complexity. SIAM J. Comput., 37(1):20-46, 2007.
17. On1/3). J. Comput. Syst. Sci., 68(2): 303-318, 2004.
18. A. R. Klivans and A. A. Sherstov. A lower bound for agnostically learning disjunctions. In COLT 2007.
19. M. Krause and P. Pudlák. On the computational power of depth-2 circuits with threshold and modulo gates. Theor. Comput. Sci., 174(1-2): 137-156, 1997.
20. N. Linial, S. Mendelson, G. Schechtman, and A. Shraibman. Complexity measures of sign matrices. Combinatorica, 27(4):439-463, 2007.
21. S. V. Lokam. Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity. J. Comput. Syst. Sci., 63(3):449-473, 2001.
22. M. L. Minsky and S. A. Papert. Perceptrons: Expanded edition. MIT Press, Cambridge, Mass., 1988.
23. R. O'Donnell and R. A. Servedio. New degree bounds for polynomial threshold functions. In STOC 2003.
24. R. Paturi and J. Simon. Probabilistic communication complexity. J. Comput. Syst Sci., 33(1):106-123, 1986.
25. P. Pudlák, V. Rödl, and P. Savický. Graph complexity. Acta Inf., 25(5):515-535, 1988.
26. A. A. Razborov. Bounded-depth formulae over the basis {&, ⊕} and some combinatorial problems. Complexity Theory and Applied Mathematical Logic, vol. "Problems of Cybernetics": 146-166, 1988. In Russian, available at http://www.mi.ras.ru/~razborov/graph.pdf.
27. A. A. Razborov. On rigid matrices. Manuscript in Russian, available at http://www.mi.ras.ru/~razborov/rigid.pdf, June 1989.
28. T. J. Rivlin. An Introduction to the Approximation of Functions. Dover Publications, New York, 1981.
29. 0 from depth-2 majority circuits. In STOC 2007.
30. A. A. Sherstov. Halfspace matrices. Comput. Complex., 17(2): 149-178, 2008.
31. A. A. Sherstov. The pattern matrix method for lower bounds on quantum communication. In STOC 2008.
32. A. A. Sherstov. The unbounded-error communication complexity of symmetric functions. In FOCS 2008.
33. J. Tarui and T. Tsukiji. Learning DNF by approximating inclusion-exclusion formulae. In CCC 1999.
34. L. G. Valiant. A theory of the learnable. Commun. ACM, 27(11): 1134-1142, 1984.
35. U. V. Vazirani. Strong communication complexity or generating quasirandom sequences form two communicating semi-random sources. Combinatorica, 7(4):375-392, 1987.