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:
“To be perfectly, brutally honest, those of us who are still carrying diaper everywhere we go are not at our most scintillating time of life....We need to remember that at one time in our lives, we all had senses of humor and knew things that were going on in the world. And if we just keep our social networks open, there will be people ready to listen when we once again have intelligent things to say.”
—Louise Lague (20th century)