Editing Complexity class (section)

====EXPTIME and NEXPTIME====
{{Main|EXPTIME|NEXPTIME}}
'''EXPTIME''' (sometimes shortened to '''EXP''') is the class of decision problems solvable by a deterministic Turing machine in exponential time and '''NEXPTIME''' (sometimes shortened to '''NEXP''') is the class of decision problems solvable by a nondeterministic Turing machine in exponential time. Or more formally,
: <math>\mathsf{EXPTIME} = \bigcup_{k\in\mathbb{N}} \mathsf{DTIME}(2^{n^k}) </math>
: <math>\mathsf{NEXPTIME} = \bigcup_{k\in\mathbb{N}} \mathsf{NTIME}(2^{n^k}) </math>

'''EXPTIME''' is a strict superset of '''P''' and '''NEXPTIME''' is a strict superset of '''NP'''. It is further the case that '''EXPTIME'''<math>\subseteq</math>'''NEXPTIME'''. It is not known whether this is proper, but if '''P'''='''NP''' then '''EXPTIME''' must equal '''NEXPTIME'''.