Learning Monotone kμ DNF Formulas on Product Distributions
- 1 January 1991
- book chapter
- Published by Elsevier
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- When won't membership queries help?Published by Association for Computing Machinery (ACM) ,1991
- Learning 2μDNF Formulas and kμ Decision TreesPublished by Elsevier ,1991
- A guided tour of chernoff boundsInformation Processing Letters, 1990
- LEARNING DNF UNDER THE UNIFORM DISTRIBUTION IN QUASI-POLYNOMIAL TIMEPublished by Elsevier ,1990
- Computational limitations on learning from examplesJournal of the ACM, 1988
- On the learnability of Boolean formulaePublished by Association for Computing Machinery (ACM) ,1987
- A theory of the learnableCommunications of the ACM, 1984