Complexity of computing Vapnik-Chervonenkis dimension
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 279-287
- https://doi.org/10.1007/3-540-57370-4_54
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Characterizations of learnability for classes of { O, …, n }-valued functionsPublished by Association for Computing Machinery (ACM) ,1992
- Approximate testing and learnabilityPublished by Association for Computing Machinery (ACM) ,1992
- Results on learnability and the Vapnik-Chervonenkis dimensionInformation and Computation, 1991
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- On finding a minimum dominating set in a tournamentTheoretical Computer Science, 1988
- A theory of the learnableCommunications of the ACM, 1984