ESPACE
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 2O(n).
See also EXPSPACE.
This is an old revision of this page, as edited by Nihiltres (talk | contribs) at 20:58, 21 October 2021 (Standardized hatnote). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
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 2O(n).
See also EXPSPACE.
| P ≟ NP | This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it. |