-
-
ENRead full article on Wikipedia · CC-BY-SA
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.
-
Draw a kanji, then tap a candidate to add it to your search.
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.
