NEXPSPACE
|
|
In computational complexity theory, the complexity class NEXPSPACE is the set of decision problems that can be solved by a non-deterministic Turing machine in space O(2p(n)) for some polynomial function p(n).
In terms of NSPACE,
- <math>\mbox{NEXPSPACE} = \bigcup_{k\in\mathbb{N}} \mbox{NSPACE}(2^{n^k})<math>