Pseudopolynomial time is the running-time behavior of an algorithm that is polynomial time when the input's numerical values are treated as its size, but not necessarily when its bit length is used. Its running time can therefore be exponential in the length of a binary encoding of the input.
Algorithms for the subset sum problem and subset product problem that are polynomial in the target value are standard examples.
