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:
“I think it’s unfair for people to try to make successful blacks feel guilty for not feeling guilty.... We’re unique in that we’re not supposed to enjoy the things we’ve worked so hard for.”
—Patricia Grayson, African American administrator. As quoted in Time magazine, p. 59 (March 13, 1989)