On the degree of boolean functions as real polynomials
- 1 December 1994
- journal article
- research article
- Published by Springer Nature in computational complexity
- Vol. 4 (4) , 301-313
- https://doi.org/10.1007/bf01263419
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Learning decision trees using the Fourier spectrumPublished by Association for Computing Machinery (ACM) ,1991
- The expressive power of voting polynomialsPublished by Association for Computing Machinery (ACM) ,1991
- Exact time bounds for computing boolean functions on PRAMs without simultaneous writesPublished by Association for Computing Machinery (ACM) ,1990
- Constant depth circuits, Fourier transform, and learnabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- The influence of variables on Boolean functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Lower bounds on the size of bounded depth circuits over a complete basis with logical additionMathematical Notes, 1987
- Algebraic methods in the theory of lower bounds for Boolean circuit complexityPublished by Association for Computing Machinery (ACM) ,1987
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- A Comparison of Uniform Approximations on an Interval and a Finite Subset ThereofSIAM Journal on Numerical Analysis, 1966
- Schwankung von Polynomen zwischen GitterpunktenMathematische Zeitschrift, 1964