Equivalence of models for polynomial learnability

[1]  Leonard Pitt,et al.  Prediction-Preserving Reducibility , 1990, J. Comput. Syst. Sci..

[2]  Leonard Pitt,et al.  On the necessity of Occam algorithms , 1990, STOC '90.

[3]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[4]  Alon Itai,et al.  Learnability by fixed distributions , 1988, COLT '88.

[5]  David Haussler,et al.  Predicting (0, 1)-functions on randomly drawn points , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[6]  Nathan Linial,et al.  Results on learnability and the Vapnik-Chervonenkis dimension , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[7]  Leslie G. Valiant,et al.  Computational limitations on learning from examples , 1988, JACM.

[8]  Alon Itai,et al.  Nonuniform Learnability , 1988, J. Comput. Syst. Sci..

[9]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[10]  B. K. Natarajan Learning Functions from Examples , 1987 .

[11]  David Haussler,et al.  Occam's Razor , 1987, Inf. Process. Lett..

[12]  Balas K. Natarajan,et al.  On learning Boolean functions , 1987, STOC.

[13]  M. Kearns,et al.  Recent Results on Boolean Concept Learning , 1987 .

[14]  Leslie G. Valiant,et al.  Learning Disjunction of Conjunctions , 1985, IJCAI.

[15]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[16]  Temple F. Smith Occam's razor , 1980, Nature.

[17]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[18]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[19]  Norbert Sauer,et al.  On the Density of Families of Sets , 1972, J. Comb. Theory, Ser. A.

[20]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .