Source: wikibot/pseudo-polynomial-time
= Pseudo-polynomial time
{wiki=Pseudo-polynomial_time}
Pseudo-polynomial time refers to a classification of algorithmic complexity that is related to the performance of algorithms specifically in the context of certain types of integer-based problems. An algorithm is said to run in pseudo-polynomial time if its running time is polynomial in the numeric value of the input, rather than the size of the input in terms of the number of bits it takes to represent that input.