Statements (33)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complementClass |
gptkb:EXPTIME
|
| gptkbp:completeProblem |
gptkb:generalized_chess
gptkb:succinct_circuit_value_problem generalized Go generalized checkers |
| gptkbp:contains |
gptkb:co-NP
P NP all problems solvable in polynomial space (PSPACE) |
| gptkbp:definedIn |
set of decision problems solvable by a deterministic Turing machine in O(2^{p(n)}) time for some polynomial p(n)
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
EXPTIME
|
| gptkbp:introducedIn |
gptkb:complexity_theory
|
| gptkbp:lowerBound |
gptkb:PSPACE
P NP |
| gptkbp:namedFor |
gptkb:Michael_Sipser
|
| gptkbp:notation |
DTIME(2^{poly(n)})
|
| gptkbp:openQuestion |
gptkb:P_vs_EXPTIME
EXPTIME vs NEXPTIME EXPTIME vs PSPACE |
| gptkbp:relatedTo |
gptkb:PSPACE
gptkb:NEXPTIME P NP |
| gptkbp:standsFor |
exponential time
|
| gptkbp:strictlyContains |
gptkb:PSPACE
P NP |
| gptkbp:upperBound |
gptkb:NEXPTIME
|
| gptkbp:bfsParent |
gptkb:complexity_theory
|
| gptkbp:bfsLayer |
4
|