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:
“The Virgin filled so enormous a space in the life and thought of the time that one stands now helpless before the mass of testimony to her direct action and constant presence in every moment and form of the illusion which men thought they thought their existence.”
—Henry Brooks Adams (1838–1918)