Cook-Levin Theorem厨师莱文定理.ppt

Proof of Cook-Levin Theorem What to prove is … (restated) SAT∈NP (very clear, not treated here) ?A∈NP, A≤PSAT Definition (restated) A≤PB if ?f such that w∈A?f(w)∈B and f is polynomial time computable. What we’ve shown is … w, A, and w∈A f(w)=φ, B=SAT, and φ=f(w)∈B=SAT w∈A?φ∈SAT ∴A≤PSAT Applied Algorithm Lab. KAIST * Illustration N=(Q, Σ, Γ, δ, q0, qaccept) Q={q0, q1, qaccept} Σ={0, 1}, Γ={0, 1, ?} δ(q0,0)={(q1,0,R)} δ(q1,1)={(q1,1,R)} δ(q1, ?)={(qaccept, ?,L)} A=L(N)={01+}={01, 011, 0111, 01111, …} w=0111 Then, w∈A? * Applied Algorithm Lab. KAIST Illustration N can decide in n2 steps where n=|w|. Therefore n2 is 16. C={q0, q1, qaccept, 0, 1, ?, #} # q0 0 1 1 1 ? … ? # # # # # # # * 16×16 tableau Applied Algorithm Lab. KAIST Illustration * Applied Algorithm Lab. KAIST Illustration * Applied Algorithm Lab. KAIST Illustration * Applied Algorithm Lab. KAIST Illustration For φmove, find out all the legal windows. * # q0 0 # 0 q1 q0 0 0 0 q1 0 q0 0 1 0 q1 1 … 0 q1 1 0 1 q1 1 q1 1 1 1 q1 q1 1 0 1 q1 0 … 1 1 q1 1 1 ? 1 q1 ? 1 ? qacc q1 ? ? ? qacc ? q1 1 1 1 q1 1 … ? ? ? qacc ? ? … … No more than n2k|C|6=42*246=410 legal windows exist. (finite) Applied Algorithm Lab. KAIST Illustration * Applied Algorithm Lab. KAIST Illustration Now, we get φ=φcell∧φstart∧φmove∧φaccept. * Applied Algorithm Lab. KAIST ∧ Illustration * Solve a SAT problem with this Boolean formula, φ. If satisfiable, w=0111∈A={01+}. (Actually, it is right.) Applied Algorithm Lab. KAIST ∧ Corollary: 3SAT∈NPC CNFs can be converted into CNFs with three literals per clause (as explained soon). At first, convert φcell, φstart, φmove, and φaccept into CNF. Applied Algorithm Lab. KAIST * Corollary: 3SAT∈NPC φcell, φstart, and φaccept are already in CNF. Applied Algorithm Lab. KAIST * Corollary: 3SAT∈NPC φmove is converted into CNF using the distributive laws. To CNFs have 3 literals per clause For each clause with less than 3 literals, do literal replication. For each clause with more than 3 literals,