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(2^p(n)) for some polynomial function p(n).

In terms of NSPACE,

$\mbox{NEXPSPACE} = \bigcup_{k\in\mathbb{N}} \mbox{NSPACE}(2^{n^k})$

It is equal to EXPSPACE, by Savitch's theorem.

This computer science-related article is a stub. You can help Wikipedia by expanding it.