NP is as easy as detecting unique solutions

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

Computing, Computer Science, Mathematics +17

The complexity of computing the permanent

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

Computing, Computer Science, Mathematics +9

Universal classes of hash functions

J.Lawrence Carter, Mark N. Wegman · Journal of Computer and System Sciences · 1979 · 2.6K citations

Computing, Computer Science, Mathematics +10

A complexity theoretic approach to randomness

Michael Sipser · 1983 · 470 citations · Full text

Computing, Computer Science, Mathematics +13

On Isomorphisms and Density of $NP$ and Other Complete Sets

L. Berman, Juris Hartmanis · SIAM Journal on Computing · 1977 · 460 citations

Computing, Computer Science, Mathematics +15