Recitation 21: Dynamic Programming: Knapsack Problem

Published: Dec. 10, 2012, 5:39 p.m.

This recitation discusses the knapsack problem and polynomial time vs. pseudo-polynomial time.