Subset Sum and Partition are NP-complete - Complexity Theory - Design and Analysis of Algorithms
In this video I give reductions between Subset Sum and Partition (and vice versa) to show they are equivalent in complexity and are both members of NP-complete.
▶︎
Vertex Cover is NP-complete - Complexity Theory - Design and Analysis of Algorithms
▶︎
16. Complexity: P, NP, NP-completeness, Reductions
▶︎
Hamiltonian Path is NP-Complete (Directed, Reduction from 3SAT)
▶︎
Subset Sum - 2D Dynamic Programming - Design and Analysis of Algorithms
▶︎
8. NP-Hard and NP-Complete Problems
▶︎
W11L61_SUBSET-SUM is NP-Complete
▶︎
We're 99.9% sure this pattern is true, but no one can prove it
▶︎
The Satisfiability Problem, and SAT is in NP
▶︎
Clique and Subset Sum are in NP
▶︎
A Breakthrough in Graph Theory - Numberphile
▶︎
Watch this if everything feels too much (gentle comfort for tired women)
▶︎
Hamiltonian Cycle is NP-Complete (Algorithms 24)
▶︎
Introduction to Algorithms - Design and Analysis of Algorithms
▶︎
Algorithms Lecture 35: NP-Completeness (3) Reduction Examples, Segment 3: Subset Sum & Set Partition
▶︎
Partition Equal Subset Sum - Dynamic Programming - Leetcode 416 - Python
▶︎
Partition Problem - 2 subsets of equal sum, as closely as possible - tutorial and source code
▶︎
R10 Q3: Vertex Cover to Independent Set Reduction
▶︎
NP Completeness 8 - Vertex Cover Problem
▶︎
P vs. NP and the Computational Complexity Zoo
▶︎