As we saw above, the algorithm takes exponential time as a function of the size of \(k\), even if its behaviour can bee seen as polynomial with respect to the numeric value of \(k\). These kinds of algorithms belong in a complexity class called pseudopolynomial complexity .