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…
The Theory of NP-Completeness NP P NPC NP: Non-deterministic Polynomial P: Polynomial NPC: Non-deterministic Polynomial Complete P=NP ? X = P P: the class of problems which…