Learning Probabilistic Readonce Formulas on Product Distributions
- 1 January 1991
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Exact identification of circuits using fixed points of amplification functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient distribution-free learning of probabilistic conceptsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Learning Read-Onee Formulas over Fields and Extended BasesPublished by Elsevier ,1991
- Improved Learning of AC0 FunctionsPublished by Elsevier ,1991
- Learning Monotone kμ DNF Formulas on Product DistributionsPublished by Elsevier ,1991
- Crytographic limitations on learning Boolean formulae and finite automataPublished by Association for Computing Machinery (ACM) ,1989
- LEARNING READ-ONCE FORMULAS USING MEMBERSHIP QUERIESPublished by Elsevier ,1989
- Learning from noisy examplesMachine Learning, 1988
- Occam's RazorInformation Processing Letters, 1987
- On the learnability of Boolean formulaePublished by Association for Computing Machinery (ACM) ,1987