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:
“When I saw it I was so glad I could not speak. My eyes seemed too little to see it all.... I was a long time without speaking to my friend. To see me always looking and never speaking he thought I had lost my mind. I could not understand where all this could come from.”
—For the State of Maine, U.S. public relief program (1935-1943)