Polynomial Time Reductions (Algorithms 21)
27:00
Verifiers and the Class NP (Algorithms 22)
1:25:25
16. Complexity: P, NP, NP-completeness, Reductions
1:21:08
17. Complexity: Approximation Algorithms
31:53
8. NP-Hard and NP-Complete Problems
10:53
What Makes Mario NP-Hard? (Polynomial Reductions)
14:17
How the Elite rigged Society (and why it’s falling apart) | David Brooks
15:33
P vs. NP - The Biggest Unsolved Problem in Computer Science
21:44