Name: Recitation 21: Dynamic Programming: Knapsack Problem
Uploaded: 2013-01-14T20:26:39Z
Duration: 1 h 9 min 12 s
Description: Description: This recitation discusses the knapsack problem and polynomial time vs. pseudo-polynomial time. Instructor: Victor Costan

1:09:12

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

Instructor: Victor Costan