Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational complexity problem
|
| gptkbp:asksWhether |
P equals PSPACE
P is a strict subset of PSPACE |
| gptkbp:field |
theoretical computer science
|
| gptkbp:formedBy |
1970s
|
| gptkbp:hasNoKnownResolution |
true
|
| https://www.w3.org/2000/01/rdf-schema#label |
P vs PSPACE
|
| gptkbp:implies |
If P = PSPACE, then P = NP
If P ≠ PSPACE, then P ≠ NP |
| gptkbp:importantFor |
major open problem in complexity theory
|
| gptkbp:isOpenProblem |
true
|
| gptkbp:relatedTo |
gptkb:P_vs_NP
gptkb:P_(complexity_class) gptkb:PSPACE_(complexity_class) space complexity time complexity PSPACE-complete |
| gptkbp:status |
unsolved
|
| gptkbp:bfsParent |
gptkb:PSPACE
|
| gptkbp:bfsLayer |
5
|