Research any topic before you write.
Find related topics. | Discover entities. | See connections. | Build a topical map.
EXPSPACE: Examples of problems, Overview & Formal definition
In computational complexity theory, EXPSPACE is the set of all decision problems solvable by a deterministic Turing machine in exponential space, i.e., in O ( 2 p ( n ) ) {\displaystyle O(2^{p(n)})} space, where p ( n ) {\displaystyle p(n)} is a polynomial function of n {\displaystyle n} . Some authors restrict p ( n ) {\displaystyle p(n)} to be a linear…
Language: English [EN]
