Google
×
NEXPTIME

NEXPTIME

In computational complexity theory, the complexity class NEXPTIME is the set of decision problems that can be solved by a non-deterministic Turing machine using time 2^{n^{O(1)}}. Wikipedia