 Pseudopolynomial time

A time complexity polynomial in numerical input values, which need not be polynomial in their binary encoding lengths. For example, an $O(nW)$ knapsack algorithm depends on the capacity $W$, while its input representation needs only $O(\log (W+1))$ bits for that capacity.