(1) Any function which is the sum of constants times powers of the argument: f(x)=Σ_i=0^k c_ix^p_i. (2) In complexity theory, the measure of computation, m(n) (usually execution time or memory space), is bounded by a polynomial function of the problem size, n. More formally m(n) = O(n^k).