• DocumentCode
    2200602
  • Title

    Relationships between NP-sets, Co-NP-sets, and P-sets relative to random oracles

  • Author

    Vereschchagin, N.K.

  • Author_Institution
    Inst. of New Technol., Moscow
  • fYear
    1993
  • fDate
    18-21 May 1993
  • Firstpage
    132
  • Lastpage
    138
  • Abstract
    It is proved that relative to random oracle A (with respect to the uniform measure) the following assertions hold: (1) there is a pair of disjoint NPA-sets that are separable by no PA-set, (2) there is a pair of disjoint Co-NPA-sets that are separable by no PA-set, and (3) there is an infinite Co-NPA-set having no infinite NPA-subset
  • Keywords
    computational complexity; Co-NP-sets; NP-sets; P-sets; disjoint NPA-sets; random oracles; Complexity theory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1993., Proceedings of the Eighth Annual
  • Conference_Location
    San Diego, CA
  • Print_ISBN
    0-8186-4070-7
  • Type

    conf

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