ESPACE
Snapshot
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In computational complexity theory, the complexity class ESPACE is the set of decision problems that can be solved by a deterministic Turing machine in space 2 O(n) . See also EXPSPACE.
In computational complexity theory, the complexity class ESPACE is the set of decision problems that can be solved by a deterministic Turing machine in space 2 O(n) . See also EXPSPACE. ==External links==
Text derived from https://en.wikipedia.org/w/index.php?oldid=1303256389 under CC BY-SA 4.0; modifications have been made.