On the necessity of Occam algorithms

A theory of the learnable

1984 • 4,471 citations

Untitled

1990 • 3,286 citations

A theory of the learnable

1984 • 2,968 citations

The strength of weak learnability

1990 • 2,267 citations

Learnability and the Vapnik-Chervonenkis dimension

1989 • 1,855 citations

Occam's Razor

1987 • 1,044 citations

Untitled

1987 • 790 citations

Computational Complexity of Probabilistic Turing Machines

1977 • 709 citations

Computational limitations on learning from examples

1988 • 542 citations

A general lower bound on the number of examples needed for learning

1989 • 435 citations

Learning decision lists

1987 • 356 citations

Crytographic limitations on learning Boolean formulae and finite automata

1989 • 272 citations

Untitled

1990 • 211 citations

Untitled

1989 • 156 citations

Prediction-preserving reducibility

1990 • 152 citations

Learning in the presence of malicious errors

1988 • 129 citations

Negative results for equivalence queries

1990 • 78 citations

Equivalence of models for polynomial learnability

1988 • 76 citations

Learning conjunctive concepts in structural domains

1989 • 59 citations

The minimum consistent DFA problem cannot be approximated within any polynomial

2003 • 46 citations

Towards representation independence in PAC learning

1989 • 25 citations

Polynomial learnability of semilinear sets

1989 • 14 citations

Computational learning theory : new models and algorithms

1989 • 11 citations