The term sub-exponential time is used to express that the running time of some algorithm may grow faster than any polynomial but is still significantly smaller than an exponential. In this sense, problems that have sub-exponential time algorithms are somewhat more tractable than those that only have exponential algorithms. The precise definition of "sub-exponential" is not generally agreed upon, and we list the two most widely used ones below.
Read more about this topic: Time Complexity
Famous quotes containing the word time:
“We should not say that one man’s hour is worth another man’s hour, but rather that one man during an hour is worth just as much as another man during an hour. Time is everything, man is nothing: he is at the most time’s carcass.”
—Karl Marx (1818–1883)
Related Phrases
Related Words