15-453 Formal Languages, Automata, and Computation
Lecture 32: Polynomial Time Reductions
An important tool in the study of computability is the notion
of mapping reducibility. In the study of the classes P and NP,
polynomial time reductions provide us with a similar tool.
We illustrate them through some examples, leading up to the
study of NP-completeness.