• DocumentCode
    2517712
  • Title

    The complexity types of computable sets

  • Author

    Maass, Wolfgang ; Slaman, Theodore A.

  • Author_Institution
    Dept. of Math., Stat., & Comput. Sci., Illinois Univ., Chicago, IL, USA
  • fYear
    1989
  • fDate
    19-22 Jun 1989
  • Firstpage
    231
  • Lastpage
    239
  • Abstract
    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 ⊆ 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
  • Keywords
    computational complexity; complexity types; computable sets; fine structure; linear-time reductions; polynomial-time reductions; random access machines; sparse set; time complexity classes; Algorithm design and analysis; Chromium; Computer science; Costs; Delay; Injuries; Pathology; Polynomials; Read-write memory; Turing machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1989. Proceedings., Fourth Annual
  • Conference_Location
    Eugene, OR
  • Print_ISBN
    0-8186-1958-9
  • Type

    conf

  • DOI
    10.1109/SCT.1989.41830
  • Filename
    41830
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2517712