Equivalence of models for polynomial learnability
- 1 December 1991
- journal article
- Published by Elsevier in Information and Computation
- Vol. 95 (2), 129-161
- https://doi.org/10.1016/0890-5401(91)90042-z
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Prediction-preserving reducibilityJournal of Computer and System Sciences, 1990
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Computational limitations on learning from examplesJournal of the ACM, 1988
- Queries and concept learningMachine Learning, 1988
- Learning decision listsMachine Learning, 1987
- Occam's RazorInformation Processing Letters, 1987
- A theory of the learnableCommunications of the ACM, 1984
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- On the density of families of setsJournal of Combinatorial Theory, Series A, 1972
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971