• DocumentCode
    1819305
  • Title

    Relativized polynomial time hierarchies having exactly K levels

  • Author

    Ko, Ker-I

  • Author_Institution
    Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
  • fYear
    1988
  • fDate
    14-17 Jun 1988
  • Firstpage
    251
  • Abstract
    Summary form only given. The relativization of the Meyer-Stockmeyer polynomial-time hierarchy is treated. The proof techniques combine an encoding scheme with probabilistic arguments
  • Keywords
    computational complexity; K levels; Meyer-Stockmeyer polynomial-time hierarchy; encoding scheme; probabilistic arguments; relativization; Circuits; Computer science; Encoding; Interference; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1988. Proceedings., Third Annual
  • Conference_Location
    Washington, DC
  • Print_ISBN
    0-8186-0866-8
  • Type

    conf

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