ESPACE
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
[edit]
Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.
Ray ID: a40789ec2850cf75
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.
| P ≟ NP | This theoretical computer science–related article is a stub. You can help Wikipedia by adding missing information. |