The Relative Complexity of NP Search Problems

On the complexity of the parity argument and other inefficient proofs of existence

Christos H. Papadimitriou · Journal of Computer and System Sciences · 1994 · 797 citations

Computing, Computer Science, Mathematics +4

How easy is local search?

David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis · Journal of Computer and System Sciences · 1988 · 714 citations · Full text

Computing, Data Science, Information Retrieval +8

Every Prime Has a Succinct Certificate

Vaughan Pratt · SIAM Journal on Computing · 1975 · 310 citations

Computing, Computer Science, Mathematics +11

Generic oracles and oracle classes

Manuel Blum, Russell Impagliazzo · 1987 · 158 citations

Computing, Computer Science, Mathematics +16

On the complexity of local search

Christos H. Papadimitriou, Alejandro A. Schäffer, Mihalis Yannakakis · 1990 · 105 citations · Full text

Computing, Computer Science, Algorithms +12