All Subjects
Light
6.1
Types of reductions: many-one and Turing reductions
6.2
Properties of polynomial-time reductions
6.3
Definition of NP-completeness
6.4
Techniques for proving NP-completeness