PP is as Hard as the Polynomial-Time Hierarchy

Toda, S. (1991). PP is as Hard as the Polynomial-Time Hierarchy.

Type

Unclassified

Intellectual base

Unclassified

Year

1991

DOI

10.1137/0220053

Link

https://doi.org/10.1137/0220053

Cited by

1 citation across 1 artifact.

Domain-specific

• Counting hierarchy
  • … definition C(n+1)P equals PP to CnP, union CH, containments such as PH within low levels and CH within PSPACE, completeness and reduction conventions and unresolved collapse questions are explicit. to An applied instance preserves the invariant under changed notation, scale, dataset, jurisdiction, or implementation..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:4707b4986bf0 · see in the full table