ESPACE
From Wikipedia, the free encyclopedia
For the car, see Renault 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.
[edit] External links
| P ≟ NP | This theoretical computer science-related article is a stub. You can help Wikipedia by expanding it. |
