• DocumentCode
    2517692
  • Title

    On the power of probabilistic polynomial time: PNP[log] ⊆ PP

  • Author

    Beigel, Richard ; Hemachandra, Lane A. ; Wechsung, Gerd

  • Author_Institution
    Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
  • fYear
    1989
  • fDate
    19-22 Jun 1989
  • Firstpage
    225
  • Lastpage
    227
  • Abstract
    It is shown that probabilistic time is closed under polynomial-time parity reductions. Therefore, every set polynomial-time truth-table reducible to SAT is accepted by a probabilistic polynomial-time Turing machine. Equivalently, PNP[log] ⊆ PP
  • Keywords
    Turing machines; computational complexity; polynomials; Turing machine; parity reductions; power; probabilistic polynomial time; truth-table; Complexity theory; Computer science; Polynomials; Testing; 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.41828
  • Filename
    41828
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2517692