MIT
Recitation 21: Dynamic Programming: Knapsack Problem
Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceEngineering
Om kurset
Description: This recitation discusses the knapsack problem and polynomial time vs. pseudo-polynomial time. Instructor: Victor Costan