Skiena's Algorithms
Lectures
Steven Skiena
Dept. of Computer Science
Stony Brook University
Lecture 21 -
Reductions
Lecture Topics:
Theory of NP-Completeness, Bandersnatch, NP problems
Previous Lecture
Semester Index
Next Lecture
Notes in PDF
Best Video (1997)
Most Recent (2007)
Discrete Math lectures
Textbook resources
Course page