Deciding the Vapnik–Červonenkis Dimension is∑p3-complete
- 1 February 1999
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 58 (1), 177-182
- https://doi.org/10.1006/jcss.1998.1602
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On limited nondeterminism and the complexity of the V-C dimensionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximable SetsInformation and Computation, 1995
- Quantifying the Amount of VerbosenessInformation and Computation, 1995
- Computability of convex setsLecture Notes in Computer Science, 1995
- The VC-dimensions of finite automata with n statesLecture Notes in Computer Science, 1993
- Complexity of computing Vapnik-Chervonenkis dimensionLecture Notes in Computer Science, 1993
- On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functionsLecture Notes in Computer Science, 1993
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Results on learnability and the Vapnik-Chervonenkis dimensionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Densité et dimensionAnnales de l'institut Fourier, 1983