[Tod91] PP is as Hard as the Polynomial-Time Hierarchy

Authors: Seinosuke Toda | Venue: SIAM Journal on Computing 1991 | Source

The Source link is the FOCS 1989 conference version, On the Computational Power of PP and ⊕P.

Abstract

TODO — abstract.

BibTeX

Copy

@article{Tod91,
  author  = {Seinosuke Toda},
  title   = {{PP} is as Hard as the Polynomial-Time Hierarchy},
  journal = {SIAM Journal on Computing},
  volume  = {20},
  number  = {5},
  pages   = {865--877},
  year    = {1991},
}