  In practice the asymptotic complexity of naturally occurring problems tends to be the key issue determining whether or not they are feasible.  A problem with complexity \(17n\) can be handled in under a minute on modern computers, for every instance of size a billion.  On the other hand, a problem with worst-case complexity \(2^n\) cannot be handled in our lifetimes for some instance of size a hundred.