On the degree of boolean functions as real polynomials

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 462-467

  Nisan, Noam ^a   Szegedy, Mario ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; POLYNOMIALS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; DECISION TABLES; FOURIER TRANSFORMS; TREES (MATHEMATICS);

COMBINATORIAL PROPERTIES; LOWER BOUNDS; TREE COMPLEXITY;

BOOLEAN FUNCTIONS;

COMBINATORIAL PROPERTIES; DECISION TREE COMPLEXITY; POLYNOMIAL DEGREE;

EID: 0026999436     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129757     Document Type: Conference Paper

References (14)

1. J. ASPENS, R. BEIGEL, M. FURST, AND S. RUDICH, On the expressive power of voting polynomials, STOC 1991, pages 402-409.
2. R. BEIGEL, N. REINGOLD, AND D. SPIELMAN, The perception striles back, Technical report YALEU/DCS/TR-813, Yale University, 1990.
3. J. BROOK AND R. SMOLENSKI, Polynomial threshold functions, ACO functions and spectral norms, FOCS 1990, pages 632-642.
4. E.W. CHENNY, Approximation Theory, McGraw-Hill Book Co., 1966.
5. B. CHOR AND M. GERIB-GRAUSS, On the Influence of Single Participants in Coin Flipping Schemes, SIAM Jour. Disc. Math., Vol. 1, No. 4, November 1988, pages 411-415.
6. M. DIETZFELBINGER, M. KUTYLOWSKI, R. REISCHUK, Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes, SPAA 1990.
7. J. KAHN, G. KALAI, AND N. LINIAL, The influence of vart"ables on boolean functions, FOCS 1988, pages 68-80.
8. N. LINIAL, Y. MANSOUR, N. NISAN, Constant depth circuits, Fourier transform and Learnability, FOCS 1989, pages 574579.
9. E. KUSHILEVITZ AND Y. MANSOUR, Learning decision trees using the Fourier transform, STOC 1991, pages 455-464.
10. M. MINSKY AND S. PAPERT, Perceptions, MIT press, Cambridge, 1988 Expanded edition. First edition appeared in 1968.
11. N. NISAN, CREW PRAM's and decision trees, STOC 1989, pages 327-335.
12. A.A. RAZBOROV, Lower bounds for the size of circuits of bounded depth with basis (and, xor), Math. Notes of the Academy of sciences of the USSR, 41(4), 1987, pages 333-338.
13. R, SMOLENSKI, Aigebraic methods in the theory of lower bounds for Boolean circuit compiezity, STOC 1987, pages 77-82.
14. I. WEGENER, The complexity of Boolean functions, Wiley-Teubner Series in Comp. Sci., New York - Stuttgart, 1987.