ESPACE
From Free net encyclopedia
Revision as of 00:42, 5 December 2005; view current revision
←Older revision | Newer revision→
←Older revision | Newer 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).
[edit]
External links
- Properties of ESPACE - at Complexity ZooTemplate:Comp-sci-stub