Question

10. In the proof that the 3SAT problem is polynomially reducible to the SUBSET SUM problem, put of the 3SAT problem) to a set of numbers and a target number as input of the SUBSET_SUM problem arbitrary boolean expression in 3CNF (in- we convert an (a) Please ilustrate the conversion by giving the set of numbers and the target number that will be obtained from the following boolean expression: (T ) . (b) The original boolean expression is satisfiable. reduction is correct, please number to argue that it is indeed the case a demonstration of why the use the resulting set of numbers and the target

Answer 1

Anauan Reckuctton PADOh gur that han de Ca) any poask Jinawn Npc puol lem Cau 6t a It would ke compGcakd to handle all the taickd Logrcal fum hr the taiget Au duckon puooh. NF pvel th to hare ahou volean hinula A Jotelal m a Curena of a vartaske H IM Con Junctive noimal A S00lean Aumlla cn functrn claute, eah f chrch H the drtsundron of One d mo ferale A Soolean Aimula hm - conunchire noima! fim (-CNF) each claur ha exadly thuu

1-CNF JAT asbs cuhether fatistialu y an vantabler Thii au 600leon founula 2 a allgnmet of thut4 valeur t the rponentral pounsh numbei ot roarable On Can Be chut lerd arnment ut alynomsal tme euly by tusthteding and evoluhng the irpui gMen SAT can be nedaced to -CNF-SAT though Polyndmial time p of: a Smary 1. paing the AT pon urlh ileals a liarey and cOnnetiver af nteinal node: Irdoducthg varasle y hi aut of each Interal node Retw rhng and aclaun tu tach node of the sinay the Cye the 1teal A chpld no des) 7 Convertng cach clau h cn Jun chre noumal at the conlunchron of the 10ot valase 3- and then applesng DMangan' hCNF: and then Jupplyms neded t convest lau of d 2 vangasler Pnth 9-CNF noimal foim laus to ionvert dlummy vaiaslet a Aei

XLV x K-'Kn than elow. the tu thvan th the ight and the spuson tng taom the t H A gry2)ACY ) The remandes of the De margan' conveuon uu Lau uthe tent hi the rh by slep dercan phin): 7anls1av (avs) VCKLAK V (axLAAL L)