Documents 1 The Theory of NP-Completeness 2010/11/30 2 Polynomial-time Reductions We want to solve a problem.....

Slide 1 Slide 2 1 The Theory of NP-Completeness 2010/11/30 Slide 3 2 Polynomial-time Reductions We want to solve a problem R; we already have an algorithm for a problem S…

Documents 1 The Theory of NP-Completeness 2 NP P NPC NP: Non-deterministic Polynomial P: Polynomial NPC:...

Slide 1 Slide 2 1 The Theory of NP-Completeness Slide 3 2 NP P NPC NP: Non-deterministic Polynomial P: Polynomial NPC: Non-deterministic Polynomial Complete P=NP? X = P Slide…