Jump to content

ESPACE

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jlwoodwa (talk | contribs) at 19:24, 3 January 2024 (WP:STUBSPACING). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.