Closure Properties and Witness Reduction

The complexity of computing the permanent

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

Computing, Computer Science, Mathematics +9

NP is as easy as detecting unique solutions

Leslie G. Valiant, Vijay V. Vazirani · Theoretical Computer Science · 1986 · 659 citations

Computing, Computer Science, Artificial Intelligence +4

The complexity of optimization problems

Mark W. Krentel · Journal of Computer and System Sciences · 1988 · 455 citations

Computing, Computer Science, Algorithms +8

Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1

Charles H. Bennett, John Gill · SIAM Journal on Computing · 1981 · 379 citations

Computing, Computer Science, Information Theory +12

On the computational power of PP and (+)P

Seinosuke Toda · 1989 · 236 citations

Computing, Computer Science, Mathematics +17