SubsetSum详细说明3SAT问题如何规约到SubSumSet问题.pdfVIP

SUBSET-SUM is NP-Complete • The SUBSET-SUM problem: – Instance: We are given a set S of positive integers, and a target integer t. – Question: does there exist a subset of S adding up to t? • Example: {1, 3, 5, 17, 42, 391}, target 50 – The subset sum problem is a good problem to use when proving NP- completeness for problems defined on sets of integers. – We will show that 3-SAT SUBSET-SUM. P • So: We are given an arbitrary 3-SAT formula and we wish to derive a set S of integers and a target integer t. – Then we prove that 3-SAT is satisfiable iff a subset of S adds up to t. 3-SAT = SUBSET-SUM P • Idea: we use “bit descriptions” that essentially describe the construction of the 3-SAT formula. – The integers in S will be derived from this description. – As before, we assume that there are m Boolean variables and n clauses. – Our description uses bit fields that represent different aspects of the 3-SAT formula: it has two lines for each logic variable: • One line specifies which clauses use the true version of a variable. • Another line describes which clauses use the false version of the variable. 1 – For every variable u we create a line T corresponding i i to the true value of u and another line F for the false i i value of u as follows: i u u ... u ... u c c ... c 1 2 i m 1