NESPACE
From Free net encyclopedia
In computational complexity theory, the complexity class NESPACE is the set of decision problems that can be solved by a non-deterministic Turing machine in space O(2n).
In computational complexity theory, the complexity class NESPACE is the set of decision problems that can be solved by a non-deterministic Turing machine in space O(2n).