Polynomial Time Reductions (Algorithms 21)
27:00
Verifiers and the Class NP (Algorithms 22)
1:21:08
17. Complexity: Approximation Algorithms
10:53
What Makes Mario NP-Hard? (Polynomial Reductions)
1:25:25
16. Complexity: P, NP, NP-completeness, Reductions
15:33
P vs. NP - The Biggest Unsolved Problem in Computer Science
31:53
8. NP-Hard and NP-Complete Problems
22:46
Hamiltonian Path is NP-Complete (Directed, Reduction from 3SAT)
41:44