Pseudopolynomial time refers to a complexity class of algorithms that run in polynomial time with respect to the numeric value of the input, rather than the length of the input in bits. In the context of number partitioning, pseudopolynomial time algorithms can solve certain problems efficiently when the numbers involved are not excessively large.
Articles by others on the same topic
There are currently no matching articles.