ESPACE

Last updated July 30, 2025

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).

External links

Complexity Zoo : Class ESPACE

P ≟ NP

This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.