EXPTIME

Summary

EXPTIME is the complexity class of decision problems that a deterministic Turing machine solves in time $2^{p(n)}$ for some polynomial $p$. Here $n$ is the length of the input. It contains P, NP and PSPACE. By the time hierarchy theorem, P is strictly smaller than EXPTIME, so EXPTIME-complete problems provably have no polynomial-time algorithm.