On limited nondeterminism and the complexity of the V-C dimension

Journal of Computer and System Sciences

Volumn 53, Issue 2, 1996, Pages 161-170

  Papadimitriou, Christos H ^a   Yannakakis, Mihalis ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; MATRIX ALGEBRA; PERTURBATION TECHNIQUES; PROBABILITY; PROBLEM SOLVING;

DEFAULT TRUTH ASSIGNMENT; VAPNIK CHERVONENKIS DIMENSION;

COMPUTATIONAL COMPLEXITY;

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

References (24)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, in "Proceedings 33rd Annual IEEE Symp. on Foundations of Computer Science, 1992," pp. 14-23.
2. K. R. Abrahamson, J. A. Ellis, M. R. Fellows, and M. E. Mata, On the complexity of fixed-parameter problems, in "Proceedings 30th Annual IEEE Symp. on Foundations of Computer Science, 1989," pp. 210-215.
3. L. Adleman, Two theorems on random polynomial time, in "Proceedings 19th Annual IEEE Symp. on Foundations of Computer Science, 1978," pp. 75-83.
4. L. Babai and S. Moran, Arthur-Merlin games: A randomized proof system and a hierarchy of complexity classes, J. Comput. System Sci. 36 (1988), 254-276.
5. A. Blummer, A. Ehrenfeucht, D. Haussler and M. K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. Assoc. Comput. Mach 36 (1989), 929-965.
6. L. Cai and J. Chen, On the amount of nondeterminism and the power of verifying, in "Proceedings Symp. on Mathematical Foundations of Computer Science, Lect. Notes in Comput. Sci., Vol. II, pp. 311-320, Springer-Verlag, New York/Berlin, 1993.
7. B. Chazelle and J. Friedman, A deterministic view of random sampling and its use in geometry, in "Proceedings 29th Annual IEEE Symp. on Foundations of Computer Science, 1990," pp. 539-549.
8. J. Diaz and J. Toran, Classes of bounded nondeterminism, Math. Systems Theory 23 (1990), 21-32.
9. R. G. Downey and M. R. Fellows, Fixed-parameter intractability, in "Proceedings 7th Annual Conf. on Structure in Complexity Theory, 1992," pp. 36-49.
10. D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, How easy is local search?, J. Comput. System Sci. 37 (1988), 79-100.
11. C. M. R. Kintala and P. C. Fischer, Refining nondeterminism in relativized polynomial-time bounded computations, SIAM J. Comput. 9 (1980), 46-53.
12. P. G. Kolaitis and M. N. Thakur, Logical definability of NP optimization problems, Inform. and Comput., to appear.
13. R. J. Lipton, L. Snyder, and Y. Zalcstein, The complexity of word and isomorphism problems for finite groups, in "Proceedings, Conf. on Information Sciences and Systems, 1976," pp. 33-35.
14. N. Linial, Y. Mansour, and R. Rivest, Results on learnability and Vapnik-Chervonenkis dimension, Inform. and Comput. 90 (1991), 33-49.
15. N. Meggido and U. Vishkin, On finding a minimum dominating set in a tournament, Theor. Comput. Sci. 61 (1988), 307-316.
16. log n) isomorphism technique, in "Proceedings 10th Annual ACM, Symp. on the Theory of Computing, 1978," pp. 51-58.
17. B. Monien, How to find long paths efficiently, Ann. Discrete Math. 25 (1985), 239-254.
18. C. H. Papadimitriou, Games against nature, J. Comput. System Sci. 31 (1985), 288-301.
19. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991), 425-440.
20. B. Selman, "Tractable Default Reasoning," Ph.D. thesis, Chapt. 6, University of Toronto, 1990; Also, Collection of open problems, presented at the Workshop on Coping with NP-completeness, UCSD, 1990, (M. Saks and F. Zaharoglu, Eds.).
21. B. Selman, "Tractable Default Reasoning," Ph.D. thesis, Chapt. 6, University of Toronto, 1990; Also, Collection of open problems, presented at the Workshop on Coping with NP-completeness, UCSD, 1990, (M. Saks and F. Zaharoglu, Eds.).
22. A. Shamir, IP = PSPACE, J. Assoc. Comput. Math. (1992), 869-877.
23. V. N. Vapnik and A. Y. Chervonenkis, On the uniform convergence of relative frequencies of events to their probalities, Theory Probab. Appl. 16 (1971), 264.
24. M. J. Wolf, Nondeterministic circuits, space complexity, and quasigroups, Theor. Comput. Sci., to appear.