Deterministic Algorithm for 0-1 Knapsack in Nearly Quadratic Time
The 0-1 Knapsack problem can be solved by a deterministic algorithm with time complexity O(n + w^2_max log^4 w_max), closing the gap between the previous upper bound and the conditional lower bound.
