Find link

language:

Find link is a tool written by Edward Betts.

searching for Pseudo-polynomial time 2 found (26 total)

Fractional Pareto efficiency (3,138 words) [view diff] exact match in snippet view article find links to article

in pseudo-polynomial time. They also prove that, when all values are positive, a discrete fPO+EQ1 allocation can exists and can be found in pseudo-polynomial

Karmarkar–Karp bin packing algorithms (5,909 words) [view diff] exact match in snippet view article find links to article

configuration). The knapsack problem can be solved by dynamic programming in pseudo-polynomial time: O(m⋅V){\displaystyle O(m\cdot V)}, where m is the number of inputs