Consider the following reduction involving the problems 3SAT and SUBSET-SUM-{(ACN, s) :3 iga such that -s} The reduction is given a 3CNF Boolean formula p involving n variables ri and m clauses c where we can assume without loss of generality that no clause is duplicated. (Recall that each clause is the OR of exactly three literals, where a literal is either some variable or its negation .) We construct the following numbers: Consider the following reduction involving the problems 3SAT and SUBSET-SUM-{(ACN, s) :3 iga such that -s} The reduction is given a 3CNF Boolean formula p involving n variables ri and m clauses c where we can assume without loss of generality that no clause is duplicated. (Recall that each clause is the OR of exactly three literals, where a literal is either some variable or its negation .) We construct the following numbers