An algorithm is said to be exponential time, if T(n) is upper bounded by 2poly(n), where poly(n) is some polynomial in n. More formally, an algorithm is exponential time if T(n) is bounded by O(2nk) 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) = 2O(n), where the exponent is at most a linear function of n. This gives rise to the complexity class E.
Read more about this topic: Time Complexity
Famous quotes containing the word time:
“My beloved spake, and said unto me, Rise up, my love, my fair one,
and come away.
For lo, the winter is past, the rain is over and gone;
The flowers appear on the earth; the time of the singing of birds is come, and the voice of the turtle is heard in our land;”
—Bible: Hebrew The Song of Solomon (l. II, 10–12)