CS 627 – Advanced Algorithms (Winter 2026-27): videos
All lecture videos · module page · YouTube playlist
20 videos, 6 h 57 min
| Video | Date | Title | Length | Transcript |
|---|---|---|---|---|
| 0 | 2026-10-13 | Administrativa | 35:15 | transcript & video |
| 1 | 2026-10-13 | Motivation | 12:14 | transcript & video |
| 2-1 | 2026-10-15 | P and NP Informally | 17:02 | transcript & video |
| 2-2 | 2026-10-15 | Models of Computation | 9:36 | transcript & video |
| 2-3 | 2026-10-15 | Turing Machines | 26:32 | transcript & video |
| 2-4 | 2026-10-15 | The Classes P and NP | 12:59 | transcript & video |
| 2-5 | 2026-10-15 | Nondeterminism = Verification | 10:37 | transcript & video |
| 2-6 | 2026-10-19 | VP = NP | 21:27 | transcript & video |
| 2-7 | 2026-10-19 | Karp-Reductions and NP-Completeness | 24:58 | transcript & video |
| 2-8 | 2026-10-19 | Example of an NP-Hardness Reduction | 28:34 | transcript & video |
| 2-9 | 2026-10-22 | Important NP-Complete Problems | 21:44 | transcript & video |
| 2-10 | 2026-10-22 | Complexity for Optimization Problems | 23:22 | transcript & video |
| 3-1 | 2026-10-22 | Pseudopolynomial algorithms | 14:42 | transcript & video |
| 3-2 | 2026-10-22 | Knapsack | 7:07 | transcript & video |
| 3-3 | 2026-10-26 | Knapsack DP solution | 32:09 | transcript & video |
| 3-4 | 2026-10-26 | Strong NP hardness | 24:10 | transcript & video |
| 4-1 | 2026-10-26 | Parameterized Problems | 15:21 | transcript & video |
| 4-2 | 2026-10-29 | Fixed Parameter Tractability | 23:57 | transcript & video |
| 4-3 | 2026-10-29 | Depth-Bounded Search I | 16:21 | transcript & video |
| 4-4 | 2026-10-29 | Kernelization | 39:44 | transcript & video |