Lecture 3 hours; 3 credits.
Prerequisite: CS 600
Tools to establish that a problem is NP-complete, and
techniques to cope with NP-completeness.
Approximate solutions to NP-complete
problems: randomization, local search, along with greedy strategies.
Topics include: the classes P and NP,
polynomial-time reduction, Cook's theorem and Karp's list of classic
problems, proving NP-completeness results,
NP-hardness, and coping with NP-completeness.