Non-deterministic exponential time has two-prover interactive protocols

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

Computing, Computer Science, Mathematics +17

The Knowledge Complexity of Interactive Proof Systems

Shafi Goldwasser, Silvio Micali, Charles Rackoff · SIAM Journal on Computing · 1989 · 3.3K citations

Computing, Computer Science, Mathematics +13

The complexity of computing the permanent

Leslie G. Valiant · Theoretical Computer Science · 1979 · 2.8K citations

Computing, Computer Science, Mathematics +9

Fast Probabilistic Algorithms for Verification of Polynomial Identities

Jacob T. Schwartz · Journal of the ACM · 1980 · 1.7K citations · Full text

Computing, Computer Science, Mathematics +8

Trading group theory for randomness

László Babai · 1985 · 782 citations

Natural Sciences, Mathematics, Combinatorics +8