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 faced with what so-and-so’s mother lets him do, or what the teacher said in class today or what all the kids are wearing is to be required to reexamine some part of our belief structure. Each time we rethink our values we reaffirm them or begin to change them. Seen in this way, parenthood affords us an exceptional opportunity for growth.”
—Ruth Davidson Bell (20th century)