EXPSPACE
Sign in to saveAlso known as exponential space
In computational complexity theory, '''''' is the set of all decision problems solvable by a deterministic Turing machine in exponential space, i.e., in O(2^{p(n)}) space, where p(n) is a polynomial function of n. Some authors restrict p(n) to be a linear function, but most authors instead call the resulting class . If we use a nondeterministic machine instead, we get the class , which is equal to by Savitch's theorem.
In the Vinony graph
Within Vinony's link graph, EXPSPACE is referenced by 94 other articles, and connects out to Petri net, International Standard Book Number and algorithm.
It is catalogued under the topic Complexity classes.
Its subject is documented across 12 Wikipedia language editions.
Connections
Petri net
Entity
International Standard Book Number
Entity
algorithm
Entity
set
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
Turing machine
Entity
regular expression
Entity
arXiv
Entity
exponential function
Entity
computational complexity theory
Entity
NP
Entity
NP-complete
Entity
decision problem
Entity
Ackermann function
Entity
Kleene star
Entity
concatenation
Entity
P
Entity
NP-hard
Entity
complexity class
Entity