Exponential time

A time complexity bounded by $2^{p(n)}$ for a polynomial $p$, where $n$ is the encoded input length. This usage includes bounds such as $2^{n^2}$; it need not mean only $2^{O(n)}$.

The complexity class of formal languages decidable in deterministic exponential time. It contains NP: enumerate the finitely many choices of a polynomial-length nondeterministic computation and simulate each branch with a polynomial time cutoff. There are at most $b^{p(n)}$ branches for fixed branching bound $b$ and polynomial $p$.