ESPACE

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by imported>XXBlackburnXx at 23:04, 29 July 2025 (Reverted edit by 78.26.151.100 (talk) to last version by Jlwoodwa). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Script error: No such module "For".

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.

External links


Template:Asbox