144 citations found. Retrieving documents...
Leonard Pitt and Leslie Valiant. Computational Limitations on Learning from Examples. Journal of the Association for Computing Machinery, 35:4, pages 965--984, October 1988.

 Home/Search   Document Not in Database   Context   ACM   TOC   Related Articles   Check  

This paper is cited by the following papers:

First 50 documents  Next 50

Lower Bounds on Identification Criteria for Perceptron-like.. - Schmitt (1996)   (1 citation)  (Correct)
Learning Algorithms with Applications to Robot Navigation and.. - Singh (1995)   (Correct)
Oracles and Queries that are Sufficient for - Exact Learning Nader   (Correct)
Fast Learning of k-Term DNF Formulas with Queries - Avrim Blum Carnegie (1992)   (3 citations)  (Correct)
Many-Layered Learning - Utgoff, Stracuzzi (2002)   (1 citation)  (Correct)
Inductive Generalisation in Case-Based Reasoning Systems - Griffiths (1996)   (1 citation)  (Correct)
From Boolean to Probabilistic Boolean Networks as.. - Shmulevich.. (2002)   (Correct)
An Experimental and Theoretical Comparison of Model.. - Kearns, Mansour, Ng, Ron   (57 citations)  (Correct)
Computational Sample Complexity - Decatur, Goldreich, Ron (1998)   (2 citations)  (Correct)
Decision Trees: More Theoretical Justification for Practical.. - Pechyony (2004)   (Correct)
From Boolean to Probabilistic Boolean Networks as.. - Shmulevich.. (2002)   (Correct)
Efficient Distribution-free Learning of Probabilistic Concepts - Kearns, Schapire (1993)   (108 citations)  (Correct)
A System for Incremental Learning Based on Algorithmic Probability - Solomonoff (1989)   (4 citations)  (Correct)
Weakly Learning DNF and Characterizing Statistical - Query Learning Using   (Correct)
Efficient Noise-Tolerant Learning From Statistical Queries - Kearns (1998)   (100 citations)  (Correct)
Cryptography and Machine Learning - Ronald Rivest Laboratory (1993)   (1 citation)  (Correct)
Efficient Learning of Typical Finite Automata from .. - Freund, Kearns.. (1996)   (20 citations)  (Correct)
The Sample Complexity and Computational - Complexity Of Boolean   (Correct)
From Synapses to Rules - Apolloni, Malchiodi, Orovas, Palmas (2001)   (Correct)
Learning Multivalued Multithreshold Functions - Department   (Correct)
Monotonic and Dual Monotonic Language Learning - Steffen Lange Htwk (1992)   (4 citations)  (Correct)
Links between Learning and Optimization: a Brief Tutorial - Anthony (2003)   (Correct)
Learning Algorithms with Applications to Robot Navigation and.. - Singh (1995)   (Correct)
Recent Results on Boolean Concept Learning - Michael Kearns Ming (1987)   (18 citations)  Self-citation (Pitt Valiant)   (Correct)
A General Lower Bound on the Number - Of Examples Needed   Self-citation (Valiant)   (Correct)

First 50 documents  Next 50

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