Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational complexity property
|
| gptkbp:completenessType |
PSPACE-complete
|
| gptkbp:contrastsWith |
gptkb:NP-completeness
EXPTIME-completeness NL-completeness |
| gptkbp:definedIn |
problems that are in PSPACE and PSPACE-hard
|
| gptkbp:example |
gptkb:Generalized_Geography
gptkb:Quantified_Boolean_Formula_(QBF) gptkb:TQBF |
| gptkbp:hardnessType |
PSPACE-hard
|
| https://www.w3.org/2000/01/rdf-schema#label |
PSPACE-completeness
|
| gptkbp:implies |
problem is at least as hard as any problem in PSPACE
|
| gptkbp:introducedIn |
1970s
|
| gptkbp:namedFor |
complexity theorists
|
| gptkbp:reductionType |
polynomial-time reduction
|
| gptkbp:relatedTo |
gptkb:PSPACE
theoretical computer science |
| gptkbp:studiedIn |
theoretical computer science
|
| gptkbp:bfsParent |
gptkb:Generalized_Nondeterministic_Constraint_Logic
gptkb:Larry_Stockmeyer |
| gptkbp:bfsLayer |
6
|