ESPACE

From Wikipedia, the free encyclopedia

You have new messages (last change).

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

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../e/s/p/ESPACE_f49b.html"
In other languages