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 mystical nature of American consumption accounts for its joylessness. We spend a great deal of time in stores, but if we don’t seem to take much pleasure in our buying, it’s because we’re engaged in the acts of sacrifice and self-definition. Abashed in the presence of expensive merchandise, we recognize ourselves ... as supplicants admitted to a shrine.”
—Lewis H. Lapham (b. 1935)