Intuition may suggest that it is sucient that the complexity behave like a polynomial function in the range of m which are of practical interest. The problem with such intuition is that it is not at all clear how exactly a polynomial function behaves. By the Stone-Weierstrass theorem [Rud96] it is known that any continuous function on a closed and bounded interval may be arbitrary well approximated by a polynomial. Thus, any continuous function can be said to behave like a polynomial or vice verse. This implies that almost all algorithms, including the full search solution of (2.6), have a complexity which is well approximated by a polynomial function if the size, m, is restricted to some nite range. In short, by restricting the analysis to a nite range of m will also render the notion of polynomial complexity meaningless.