NESPACE
From Free net encyclopedia
Revision as of 22:55, 1 April 2006; view current revision
←Older revision | Newer revision→
←Older revision | Newer revision→
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).