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:
“Quarrel not at all. No man resolved to make the most of himself, can spare time for personal contention. Still less can he afford to take all the consequences, including the vitiating of his temper, and the loss of self-control. Yield larger things to which you can show no more than equal right; and yield lesser ones, though clearly your own. Better give your path to a dog, than be bitten by him in contesting for the right. Even killing the dog would not cure the bite.”
—Abraham Lincoln (1809–1865)