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<sup>O(n)</sup>.
See also EXPSPACE.
ESPACE
42 words updated Jun 19, 2026, 4:11 AM
WikiHQWikiHQ42 words updated Jun 19, 2026, 4:11 AM
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<sup>O(n)</sup>.
See also EXPSPACE.