On Limited Nondeterminism and the Complexity of the V-C Dimension

Learnability and the Vapnik-Chervonenkis dimension

Anselm Blumer, Andrzej Ehrenfeucht, David Haussler et al. · Journal of the ACM · 1989 · 1.9K citations · Full text

Computing, Computer Science, Mathematics +11

Optimization, approximation, and complexity classes

Christos H. Papadimitriou, Mihalis Yannakakis · Journal of Computer and System Sciences · 1991 · 1.7K citations

Computing, Computer Science, Mathematics +12

Proof verification and hardness of approximation problems

Sanjeev Arora, Carsten Lund, R. Motwani et al. · 1992 · 744 citations

Computing, Computer Science, Mathematics +16

Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes

László Babai, Shlomo Moran · Journal of Computer and System Sciences · 1988 · 596 citations

Computing, Computer Science, Mathematics +16

Two theorems on random polynomial time

Leonard M. Adleman · 1978 · 317 citations

Computing, Computer Science, Mathematics +6