EXPTIME (${\bigcup }_{d\ge 1}\mathrm{DTIME}(2^{n^d})$)

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$.