quality:correction
Exponential time

An algorithm is said to be exponential time, if T (n) is upper bounded by 2, where poly(n) is some polynomial in n. More formally, an algorithm is exponential time if T (n) is bounded by O (2) for some constant k. Problems which admit exponential time algorithms on a deterministic Turing machine form the complexity class known as EXP.

Sometimes, exponential time is used to refer to algorithms that have T (n) = 2, where the exponent is at most a linear function of n. This gives rise to the complexity class E.