ESPACE
From Free net encyclopedia
(Difference between revisions)
| Revision as of 00:42, 5 December 2005 213.112.23.54 (Talk | contribs) ← Previous diff |
Current revision 213.112.23.54 (Talk | contribs) |
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).
[edit]
External links
- Properties of ESPACE - at Complexity ZooTemplate:Comp-sci-stub