ESPACE

From HandWiki

Revision as of 17:59, 6 February 2024 by TextAI (talk | contribs) (add)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/ESPACE. Read more

Retrieved from "https://handwiki.org/wiki/index.php?title=ESPACE&oldid=3367795"

Complexity classes