The complexity types of computable sets

The fine structure of time complexity classes for random access machines is analyzed. It is proved that a complexity type C contains sets A,B which are incomparable with respect to polynomial-time reductions if and only if it is not true that C contained in P, and that there is a complexity type C that contains a minimal pair with respect to polynomial-time reductions. The fine structure of P with respect to linear-time reductions is analyzed. It is also shown that every complexity type C contains a sparse set.<<ETX>>

[1]  Juris Hartmanis,et al.  An Overview of the Theory of Computational Complexity , 1971, JACM.

[2]  Paul Young,et al.  An introduction to the general theory of algorithms , 1978 .

[3]  Claus-Peter Schnorr,et al.  A characterization of complexity sequences , 1975, Math. Log. Q..

[4]  A. K. Dewdney.  Linear time transformations between combinatorial problems , 1982 .

[5]  Patrick C. Fischer,et al.  Computational speed-up by effective operators , 1972, Journal of Symbolic Logic.

[6]  Wolfgang Maass,et al.  Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract) , 1989, FCT.

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

[8]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[9]  Theodore A. Slaman,et al.  On the Theory of the PTIME Degrees of the Recursive Sets , 1990, J. Comput. Syst. Sci..

[10]  Stephen R. Mahaney.  Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[11]  Theodore A. Slaman,et al.  On the theory of the PTIME degrees of the recursive sets , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[12]  Alan L. Selman,et al.  A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees , 1987, Symposium on Theoretical Aspects of Computer Science.

[13]  Wolfgang Maass,et al.  The Complexity Types of Computable Sets (extended abstract) , 1989 .

[14]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[15]  Stephen A. Cook,et al.  Time-bounded random access machines , 1972, J. Comput. Syst. Sci..

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

[17]  Nancy A. Lynch,et al.  “Helping”: several formalizations , 1975, Journal of Symbolic Logic.

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

[19]  Stephen A. Cook,et al.  Time Bounded Random Access Machines , 1973, J. Comput. Syst. Sci..