Time Complexity - Sub-exponential Time

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:

    Of their virtues the symbol can be washtubs
    But when they die it is a time of singing....
    Allen Tate (1899–1979)