ESPACE

From Wikipedia, the free encyclopedia

Jump to navigation Jump to search

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

See also EXPSPACE.

External links

Complexity Zoo: Class ESPACE

P ≟ NP

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=ESPACE&oldid=1193424087"

Hidden category:

All stub articles