Improved Learning of AC0 Functions
- 1 January 1991
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Randomized polynomials, threshold circuits, and the polynomial hierarchyPublished by Springer Nature ,2005
- Constant depth circuits, Fourier transform, and learnabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Generic oracles and oracle classesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Almost optimal lower bounds for small depth circuitsPublished by Association for Computing Machinery (ACM) ,1986
- NP is as easy as detecting unique solutionsPublished by Association for Computing Machinery (ACM) ,1985
- A theory of the learnableCommunications of the ACM, 1984
- Parity, circuits, and the polynomial-time hierarchyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963