The Structure of the Honest Polynomial m-Degrees

[1]  Rodney G. Downey,et al.  On Computational Complexity and Honest Polynomial Degrees , 1991, Theor. Comput. Sci..

[2]  S. Homer,et al.  Honest polynomial reductions and exptally sets , 1990 .

[3]  Rodney G. Downey,et al.  On honest polynomial reductions, relativizations, and P=NP , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[4]  Timothy J. Long,et al.  Honest Polynomial Degrees and P=?NP , 1987, Theor. Comput. Sci..

[5]  Steven Homer,et al.  Minimal degrees for polynomial reducibilities , 1987, JACM.

[6]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[7]  Robert I. Soare.  Fundamentals of Recursively Enumerable Sets and the Recursion Theorem , 1987 .

[8]  Klaus Ambos-Spies.  Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem , 1987, Computational Complexity Conference.

[9]  Klaus Ambos-Spies.  Sublattices of the Polynomial Time Degrees , 1985, Inf. Control..

[10]  S. Homer.  Minimal polynomial degrees of nonrecursive sets , 1985 .

[11]  Paul Young,et al.  Some structural properties of polynomial reducibilities and sets in NP , 1983, STOC.

[12]  Uwe Schöning,et al.  A Low and a High Hierarchy within NP , 1983, J. Comput. Syst. Sci..

[13]  Manuel Lerman,et al.  Degrees of Unsolvability: Local and Global Theory , 1983 .

[14]  Richard J. Lipton,et al.  On the Structure of Sets in NP and Other Complexity Classes , 1981, Theor. Comput. Sci..

[15]  S. D. Denisov.  Structure of the upper semilattice of recursively enumerablem -degrees and related questions. I , 1978 .

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

[17]  Michael Machtey.  On the Density of Honest Subrecursive Classes , 1975, J. Comput. Syst. Sci..

[18]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

[19]  A. Lachlan.  Two theorems on many-one degrees of recursively enumerable sets , 1972 .

[20]  Dennis M. Ritchie,et al.  A Classification of the Recursive Functions , 1972 .

[21]  A. Lachlan.  Initial Segments of Many-One Degrees , 1970, Canadian Journal of Mathematics.

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

[23]  A. H. Lachlan.  Distributive Initial Segments of the Degrees of Unsolvability , 1968 .

[24]  Ю.Л. Ершов,et al.  Неразрешимость некоторых теорий , 1963 .

[25]  G. Sacks.  A minimal degree less than 0 , 1961 .

[26]  C. Spector.  On Degrees of Recursive Unsolvability , 1956 .