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:
“My time has been passed viciously and agreeably; at thirty-one so few years months days hours or minutes remain that “Carpe Diem” is not enough. I have been obliged to crop even the seconds—for who can trust to tomorrow?”
—George Gordon Noel Byron (1788–1824)