• DocumentCode
    2722486
  • Title

    An oracle separating ⊕P from PPPH

  • Author

    Green, Frederic

  • Author_Institution
    Dept. of Math. & Comput. Sci., Clark Univ., Worcester, MA, USA
  • fYear
    1990
  • fDate
    8-11 July 1990
  • Firstpage
    295
  • Lastpage
    298
  • Abstract
    The existence of an oracle A such that ⊕PA is not contained in PPPHA is proved. This separation follows in a straightforward manner from a circuit complexity result, which is also proved: to compute the parity of n inputs, any constant depth circuit consisting of a single threshold gate on top of ANDs and ORs requires exponential size in n
  • Keywords
    Turing machines; computational complexity; ANDs; ORs; Turing machines; circuit complexity; constant depth circuit; exponential size; parity; separation; threshold gate; Circuits; Complexity theory; Computer science; Costs; Mathematics; Polynomials; Turing machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1990, Proceedings., Fifth Annual
  • Conference_Location
    Barcelona
  • Print_ISBN
    0-8186-6072-4
  • Type

    conf

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