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:
“Not yet the thirtieth year, the thirtieth
Station where time reverses his light heels
To run both ways, and makes of forward back;
Whose long co-ordinates are birth and death....”
—Allen Tate (1899–1979)
Related Phrases
Related Words