Michael Kearns Harvard University Ming Li Harvard University Leonard Pitt...  Home/Search
Context Related
Links: ACM DBLP | upenn.edu/~mkearns/papers/klpv.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu/~mkearns/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper fall into three categories: closure properties of learnable classes, negative results, and distribution-specific positive results (Update)
Cited by: More
Separating Distribution-Free And Mistake-Bound - Learning Models Over (Correct)
Learning an Intersection of a Constant Number of.. - Avrim Blum Ravindran (1997) (Correct)
Learning in the Presence of Malicious Errors - Michael Kearns Att (1993) (Correct)
Active bibliography (related documents): More All
0.3: Recent Results on Boolean Concept Learning - Michael Kearns Ming (1987) (Correct)
0.3: PAGODA: A Model for Autonomous Learning in Probabilistic Domains - desJardins (1992) (Correct)
0.0: A General Lower Bound on the Number - Of Examples Needed (Correct)
Similar documents based on text: More All
0.2: [Tou89] David Touretsky. - Advances In Neural (Correct)
0.2: Cryptographic Limitations on Learning Boolean Formulae and.. - Kearns, Valiant (1989) (Correct)
0.2: Generalized Graph Colorability and Compressibility of.. - Nock, Jappy, Sallantin (1998) (Correct)
Related documents from co-citation: More All
32: Communications of the ACM (context) - Valiant, of et al. - 1984
30: Computational limitations on learning from examples (context) - Pitt, Valiant - 1988
30: Learnability and the Vapnik Chervonenkis Dimension (context) - Blumer, Ehrenfeucht et al. - 1989
BibTeX entry: (Update)
M. Kearns, M. Li, L. Pitt, and L. Valiant. On the learnability of boolean formulae. In Proceedings of the Nineteenth Annual ACM Symposium on the Theory of Computing, pages 285--295, New York, New York, May 1987. http://citeseer.ist.psu.edu/kearns87learnability.html More
@inproceedings{ kearns87learnability,
author = "M. Kearns and M. Li and L. Pitt and L. G. Valiant",
title = "On the Learnability of {Boolean} Formulae",
booktitle = "Proceedings of the nineteenth annual {ACM} Symposium on Theory of Computing, New York City, May 25--27, 1987",
publisher = "ACM Press",
address = "New York, NY 10036, USA",
editor = "A. V. Aho",
isbn = "0-89791-221-7",
pages = "285--295",
year = "1987",
url = "citeseer.ist.psu.edu/kearns87learnability.html" }
Citations (may not include all citations):244 Learning Regular Sets From Queries and Counterexamples (context) - Angluin - 1986 ACM DBLP
132 Fast Probabilistic Algorithms for Hamiltonian Circuits and M.. (context) - Angluin, Valiant - 1979
48 Classifying Learnable Geometric Concepts With (context) - Blumer, Ehrenfeucht et al.
3 CNF Formulas From Noisy Examples (context) - Angluin, Laird - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cis.upenn.edu/~mkearns/): More
Graphical Economics - Sham Kakade Michael (Correct)
Efficient Algorithms for Learning to Play Repeated Games Against.. - al. (1995) (Correct)
On the Boosting Ability of Top-Down Decision Tree Learning.. - Kearns (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC