Diagonalizations over polynomial time computable sets

Recursively enumerable sets and degrees

Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text

Natural Sciences, Computer Science, Mathematics +15

On the Structure of Polynomial Time Reducibility

Richard E. Ladner · Journal of the ACM · 1975 · 790 citations · Full text

Computing, Computer Science, Algorithms +5

Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question

T. P. Baker, John Gill, Robert M Solovay · SIAM Journal on Computing · 1975 · 738 citations

Computing, Computer Science, Algorithms +10

A comparison of polynomial time reducibilities

Richard E. Ladner, Nancy Lynch, Alan L. Selman · Theoretical Computer Science · 1975 · 414 citations

Computing, Computer Science, Mathematics +10

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