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:
“A baby is a full time job for three adults. Nobody tells you that when you’re pregnant, or you’d probably jump off a bridge. Nobody tells you how all-consuming it is to be a mother—how reading goes out the window and thinking too.”
—Erica Jong (20th century)