Some remarks on witness functions for nonpolynomial and noncomplete sets in NP

Theory of Recursive Functions and Effective Computability.

Solomon Feferman, Hartley Rogers · American Mathematical Monthly · 1969 · 2.8K citations

Computing, Computer Science, Mathematics +14

Theory of Recursive Functions and Effective Computability

D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text

Computing, Computer Science, Mathematics +14

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

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