NEXPTIME - NEXP is a type of complexity class that contains the set of decision problems that can be solved by a non-deterministic Turing machine in exponential time Resources https://en.wikipedia.org/wiki/NEXPTIME