Statements (26)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:closed |
closed under concatenation
closed under Kleene star closed under intersection closed under union closed under complement |
| gptkbp:completeProblem |
gptkb:Quantified_Boolean_Formula_(QBF)
|
| gptkbp:contains |
gptkb:EXPTIME
gptkb:co-NP P NP |
| gptkbp:definedIn |
set of decision problems solvable by a Turing machine using polynomial space
|
| gptkbp:equivalentTo |
NPSPACE (by Savitch's theorem)
|
| https://www.w3.org/2000/01/rdf-schema#label |
PSPACE (complexity class)
|
| gptkbp:introduced |
gptkb:Stephen_Cook
|
| gptkbp:introducedIn |
1970
|
| gptkbp:openQuestion |
Is PSPACE = EXPTIME?
Is NP = PSPACE? Is P = PSPACE? |
| gptkbp:relatedTo |
PSPACE-complete
NPSPACE |
| gptkbp:symbol |
gptkb:PSPACE
|
| gptkbp:usedIn |
theoretical computer science
|
| gptkbp:bfsParent |
gptkb:NP_(complexity_class)
gptkb:P_vs_PSPACE |
| gptkbp:bfsLayer |
6
|