NEXPTIME

Noun

 * 1)  In computational complexity theory, a complexity class in which the set of decision problems can be solved by a nondeterministic Turing machine using time $$2^{n^{O(1)}}$$.