LEARNABILITY AND THE VAPNIK-CHERVONENKIS DIMENSION

[21] EHRENFEUCHT A, IN PRESS INF COMPUT

[22] Garey M. R., 1979, COMPUTERS INTRACTABI

[23] COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES [J]. SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 675 - 695

[24] GINE E, 1986, LECTURE NOTES MATH, V1221

[25] HOW TO CONSTRUCT RANDOM FUNCTIONS [J]. JOURNAL OF THE ACM, 1986, 33 (04) : 792 - 807

[26] LINEAR FUNCTION NEURONS - STRUCTURE AND TRAINING [J]. BIOLOGICAL CYBERNETICS, 1986, 53 (04) : 203 - 217

[27] Haussler D., 1988, 29th Annual Symposium on Foundations of Computer Science (IEEE Cat. No.88CH2652-6), P100, DOI 10.1109/SFCS.1988.21928

[28] EPSILON-NETS AND SIMPLEX RANGE QUERIES [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1987, 2 (02) : 127 - 151

[29] QUANTIFYING INDUCTIVE BIAS - AI LEARNING ALGORITHMS AND VALIANTS LEARNING FRAMEWORK [J]. ARTIFICIAL INTELLIGENCE, 1988, 36 (02) : 177 - 221

[30] HAUSSLER D, 1987, 4TH P INT WORKSH MAC, P324

[21] EHRENFEUCHT A, IN PRESS INF COMPUT

[22] Garey M. R., 1979, COMPUTERS INTRACTABI

[23] COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES [J]. SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 675 - 695

[24] GINE E, 1986, LECTURE NOTES MATH, V1221

[25] HOW TO CONSTRUCT RANDOM FUNCTIONS [J]. JOURNAL OF THE ACM, 1986, 33 (04) : 792 - 807

[26] LINEAR FUNCTION NEURONS - STRUCTURE AND TRAINING [J]. BIOLOGICAL CYBERNETICS, 1986, 53 (04) : 203 - 217

[27] Haussler D., 1988, 29th Annual Symposium on Foundations of Computer Science (IEEE Cat. No.88CH2652-6), P100, DOI 10.1109/SFCS.1988.21928

[28] EPSILON-NETS AND SIMPLEX RANGE QUERIES [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1987, 2 (02) : 127 - 151

[29] QUANTIFYING INDUCTIVE BIAS - AI LEARNING ALGORITHMS AND VALIANTS LEARNING FRAMEWORK [J]. ARTIFICIAL INTELLIGENCE, 1988, 36 (02) : 177 - 221

[30] HAUSSLER D, 1987, 4TH P INT WORKSH MAC, P324