Written mathematically, there exists k > 1 such that m(n) = θ(k^{n}) and there exists c such that m(n) = O(c^{n}).
Mathematicians sometimes think of polynomial time as "fast", and anything slower than that as "slow". Exponential time would therefore be considered slow. There are algorithms which take time slower than polynomial time ("superpolynomial time") but faster than exponential time ("subexponential time"). These are also considered "slow". One example is the best known algorithm for integer factorization.
See also:
Search Encyclopedia

Featured Article
