ESPACE

From Wikipedia, the free encyclopedia

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.

[edit] External links

Properties of ESPACE - at Complexity Zoo

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

Categories: Complexity classes | Computer science stubs

Views

Interaction

Search

Languages