NP-Completeness.pptVIP

* Circuit-satisfiability problem is NP-hard (cont.) Two properties remain to be proven: F correctly constructs the reduction, i.e., C is satisfiable if and only if there exists a certificate y, such that A(x,y)=1. ?Suppose there is a certificate y, such that A(x,y)=1. Then if we apply the bits of y to the inputs of C, the output of C is the bit of A(x,y), that is C(y)= A(x,y) =1, so C is satisfiable. ?Suppose C is satisfiable, then there is a y such that C(y)=1. So, A(x,y)=1. F runs in poly time. * Circuit-satisfiability problem is NP-hard (cont.) F runs in poly time. Poly space: Size of x is n. Size of A is constant, independent of x. Size of y is O(nk). Amount of working storage is poly in n since A runs at most O(nk). M has size poly in length of configuration, which is poly in O(nk), and hence is poly in n. C consists of at most O(nk) copies of M, and hence is poly in n. Thus, the C has poly space. The construction of C takes at most O(nk) steps and each step takes poly time, so F takes poly time to construct C from x. * CIRCUIT-SAT is NP-complete In summary CIRCUIT-SAT belongs to NP, verifiable in poly time. CIRCUIT-SAT is NP-hard, every NP problem can be reduced to CIRCUIT-SAT in poly time. Thus CIRCUIT-SAT is NP-complete. * NP-completeness proof basis Lemma 34.8 (page 995) If X is a problem (class) such that P?p X for some P ? NPC, then X is NP-hard. Moreover, if X? NP, then X? NPC. Steps to prove X is NP-complete Prove X? NP. Given a certificate, the certificate can be verified in poly time. Prove X is NP-hard. Select a known NP-complete P. Describe a transformation function f that maps every instance x of P into an instance f(x) of X. Prove f satisfies that the answer to x?P is YES if and only if the answer to f(x)?X is YES for all instance x ?P. Prove that the algorithm computing f runs in poly-time. * NPC proof –Formula Satisfiability (SAT) SAT definition n boolean variables: x1, x2,…, xn. M boolean connectives: any boolean function with one or two i