|
gptkbp:instanceOf
|
theoretical computer science
|
|
gptkbp:contains
|
gptkb:PSPACE
gptkb:co-NP
P
NP
|
|
gptkbp:definedIn
|
theoretical computer science
set of decision problems solvable by a deterministic Turing machine in O(2^{p(n)}) time for some polynomial p(n)
|
|
gptkbp:discusses
|
gptkb:Arora,_Sanjeev_and_Barak,_Boaz._Computational_Complexity:_A_Modern_Approach
Sipser, Michael. Introduction to the Theory of Computation
Papadimitriou, Christos. Computational Complexity
|
|
gptkbp:hasAlternativeNotation
|
gptkb:EXPTIME
|
|
gptkbp:hasNotationFor
|
gptkb:EXP
|
|
gptkbp:hasSubgroup
|
gptkb:PSPACE
gptkb:co-NP
P
NP
ELEMENTARY
|
|
gptkbp:hasWikipediaPage
|
https://en.wikipedia.org/wiki/EXPTIME
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
EXP (complexity class)
|
|
gptkbp:isStrictlyContainedIn
|
EXPSPACE
|
|
gptkbp:numberOfIssues
|
gptkb:generalized_chess
gptkb:succinct_circuit_value_problem
generalized checkers
succinct version of SAT
succinct Hamiltonian path
succinct TQBF
succinct graph reachability
|
|
gptkbp:relatedTo
|
gptkb:EXPTIME
gptkb:NEXP
EXPSPACE
|
|
gptkbp:standsFor
|
exponential time
|
|
gptkbp:bfsParent
|
gptkb:NP_(complexity_class)
gptkb:P_(complexity_class)
|
|
gptkbp:bfsLayer
|
6
|