Subset Sum and Partition are NP-complete - Complexity Theory - Design and Analysis of Algorithms
Similar Tracks
Vertex Cover is NP-complete - Complexity Theory - Design and Analysis of Algorithms
Chris Marriott - Computer Science
Subset Sum - 2D Dynamic Programming - Design and Analysis of Algorithms
Chris Marriott - Computer Science
Algorithms Lecture 35: NP-Completeness (3) Reduction Examples, Segment 3: Subset Sum & Set Partition
Ghassan Shobaki Computer Science Lectures
NP Verifiers - Subset Sum - Knapsack - Complexity Theory - Design and Analysis of Algorithms
Chris Marriott - Computer Science