LEARNING DNF UNDER THE UNIFORM DISTRIBUTION IN QUASI-POLYNOMIAL TIME
- 1 January 1990
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A Polynomial-time Algorithm for Learning k-variable Pattern Languages from ExamplesPublished by Elsevier ,1989
- The strength of weak learnabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Constant depth circuits, Fourier transform, and learnabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Quantifying inductive bias: AI learning algorithms and Valiant's learning frameworkArtificial Intelligence, 1988
- Learning in the presence of malicious errorsPublished by Association for Computing Machinery (ACM) ,1988
- Learning quickly when irrelevant attributes abound: A new linear-threshold algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- On the learnability of Boolean formulaePublished by Association for Computing Machinery (ACM) ,1987
- A theory of the learnableCommunications of the ACM, 1984
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952