Skiena's Algorithms
Lectures
Steven Skiena
Dept. of Computer Science
Stony Brook University
Lecture 22 -
Easy reductions
Lecture Topics:
Examples of how to show a problem is NP-Complete
Previous Lecture
Semester Index
Next Lecture
Notes in PDF
Best Video (1997)
Most Recent (2007)
Discrete Math lectures
Textbook resources
Course page
