• DocumentCode
    2362808
  • Title

    On P-immunity of nondeterministic complete sets

  • Author

    Tran, Nicholas

  • Author_Institution
    Dept. of Comput. & Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA
  • fYear
    1995
  • fDate
    19-22 Jun 1995
  • Firstpage
    262
  • Lastpage
    263
  • Abstract
    We show that every m-complete set for NEXP as well as its complement have an infinite subset in P. This answers an open question first raised by L. Berman (1976)
  • Keywords
    computational complexity; NEXP; P-immunity; infinite subset; m-complete set; nondeterministic complete sets; Information science; Polynomials; Turing machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1995., Proceedings of Tenth Annual IEEE
  • Conference_Location
    Minneapolis, MN
  • ISSN
    1063-6870
  • Print_ISBN
    0-8186-7052-5
  • Type

    conf

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