10. In the proof that the 3SAT problem is polynomially reducible SUBSET_SUM problem, put of the 3SAT problem) SUBSET SUM prob

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



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *