Deciding the Vapnik-Červonenkis dimension is Σp3-complete

Journal of Computer and System Sciences

Volumn 58, Issue 1, 1999, Pages 177-182

  Schaefer, Marcus ^a  

^a THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; MATRIX ALGEBRA; PROBLEM SOLVING;

VAPNIK-CERVONENKIS (VP) DIMENSION;

PROBABILITY;

EID: 0033077964     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1602     Document Type: Article

References (19)

1. M. Anthony and N. Biggs, "Computational Learning Theory," Cambridge Univ. Press, Cambridge, 1992.
2. P. Assouad, Densité et dimension, Ann. Inst. Fourier, Grenoble 33, No. 3 (1983), 233-282.
3. R. Beigel, M. Kummer, and F. Stephan, Approximable sets, Inform. Comput. 120 (1995), 304-314.
4. R. Beigel, M. Kummer, and F. Stephan, Quantifying the amount of verboseness, Inform. Comput. 118 (1995), 73-90.
5. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. Assoc. Comput. Mach. 36, No. 4 (1989), 929-965.
6. R. M. Dudley, A course on empirical processes, in "École d'Eté de Probabilités de Saint-Flour XII-1982," Lecture Notes in Mathematics, Vol. 1097, pp. 2-142, Springer-Verlag, Berlin, 1984.
7. M. R. Garey and D. S. Johnson, "Computers and Intractability," Freeman, San Francisco, 1978.
8. Y. Ishigami and S. Tani, The VC dimensions of finite automata with n states, in "Proceedings of the 4th Workshop in Algorithmic Learning Theory, 1993," pp. 328-341.
9. S. Kaufmann and M. Kummer, On a quantitative notion of uniformity, Fund. Inform., to appear. An extended abstract appeared in "Proceedings MFCS'95, LNCS, Vol. 969, pp. 169-178, Springer-Verlag, New York/Berlin, 1995.
10. S. Kaufmann and M. Kummer, On a quantitative notion of uniformity, Fund. Inform., to appear. An extended abstract appeared in "Proceedings MFCS'95, LNCS, Vol. 969, pp. 169-178, Springer-Verlag, New York/Berlin, 1995.
11. M. Kummer and M. Schäfer, Computability of convex sets, in "Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science, 1995," pp. 550-561.
12. N. Linial, Y. Mansour, and R. L. Rivest, Results on learneability and Vapnik-Červonenkis dimension, in "Proceedings of FOCS, 1988," pp. 120-129.
13. C. H. Papadimitriou, "Computational Complexity," Addison-Wesley, Reading, MA, 1994.
14. C. H. Papadimitriou and M. Yannakakis, On limited nondeterminism and the complexity of the V-C dimension, in "Proceedings of the 8th Conference on Structure in Complexity Theory, 1993," pp. 12-18.
15. A. Sakurai, On the VC dimension of depth four threshold circuits and the complexity of Boolean-valued functions, in "Proceedings of the 4th Workshop in Algorithmic Learning Theory, 1993," pp. 279-287.
16. A. Shinohara, Complexity of computing Vapnik-Červonenkis dimension, in "Proceedings of the 4th Workshop in Algorithmic Learning Theory, 1993," pp. 279-287.
17. R. I. Soare, "Recursively Enumerable Sets and Degrees," Springer-Verlag, New York, 1987.
18. V. N. Vapnik and A. Ya. Cervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (1971), 264-280.
19. S. Wehner, "Zur Komplexität des Numerierens," thesis, Fakultät für Informatik, Universität Karlsruhe, (November 1990).