A Comparison of Polynomial Time Completeness Notions

[1]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[2]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[3]  R.E. Ladner,et al.  A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[4]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[5]  Juris Hartmanis,et al.  On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..

[6]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[7]  Daniel J. Moore,et al.  Completeness, Approximation and Density , 1981, SIAM J. Comput..

[8]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[9]  Stephen R. Mahaney.  Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..

[10]  Juris Hartmanis,et al.  Generalized Kolmogorov complexity and the structure of feasible computations , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  Alan L. Selman,et al.  Qualitative Relativizations of Complexity Classes , 1985, J. Comput. Syst. Sci..

[12]  Osamu Watanabe.  On One-One Polynomial Time Equivalence Relations , 1985, Theor. Comput. Sci..

[13]  Juris Hartmanis.  Feasible computations and provable complexity properties , 1989, CBMS-NSF regional conference series in applied mathematics.