Completeness [Cook-Levin]There is a class of NP problems, such that NP solve any of them in polynomial time, →solve all NP problems in polynomial time. 12Completeness ◼ [Cook-Levin] There is a class of NP problems, such that solve any of them in polynomial time, ⇒ solve all NP problems in polynomial time. NP P 12