Ryan O'Donnell
Undergrad Complexity at CMU - Hardness within P
Explore computational complexity theory, focusing on hardness within P, time hierarchy theorem, and fine-grained complexity. Delve into reductions, algorithms, and open questions in this advanced undergraduate lecture.