Lecture 11a from UW-Madison's Summer 2022 iteration of CS 577: Introduction to Algorithms. This guided problem-solving lecture presented examples of designing and proving the correctness of polynomial-time reductions to show a problem is NP-hard.
No download links available.
