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.
External links
[edit]
Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.
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 adding missing information. |