Statements (42)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:abbreviation |
PH
|
| gptkbp:collapsesIf |
NP = co-NP
P = NP ΣPk = ΣPk+1 for some k |
| gptkbp:contains |
gptkb:co-NP
P NP ΠP2 ΠPk ΣP2 ΣPk |
| gptkbp:field |
theoretical computer science
|
| gptkbp:generalizes |
gptkb:co-NP
P NP ΠP2 ΣP2 |
| gptkbp:hasSubgroup |
gptkb:PSPACE
gptkb:co-NP P NP ΠP2 ΠPk ΣP2 ΣPk |
| https://www.w3.org/2000/01/rdf-schema#label |
Polynomial hierarchy
|
| gptkbp:introduced |
gptkb:Larry_Stockmeyer
|
| gptkbp:introducedIn |
1976
|
| gptkbp:isInfiniteUnlessCollapses |
true
|
| gptkbp:level |
ΔPk
ΠPk ΣPk |
| gptkbp:openProblem |
Does the polynomial hierarchy collapse?
Is PH equal to PSPACE? Is PH infinite? |
| gptkbp:relatedTo |
gptkb:arithmetical_hierarchy
gptkb:oracle_Turing_machine gptkb:Boolean_hierarchy gptkb:quantified_Boolean_formula |
| gptkbp:bfsParent |
gptkb:complexity_theory
|
| gptkbp:bfsLayer |
4
|