Problem 1 (30 pts). The SUBSET SUM problem is defined as follows: given n non-negative integers w₁, W2, ..., wn and a no
Posted: Mon Jun 06, 2022 5:25 pm
Problem 1 (30 pts). The SUBSET SUM problem is defined as follows: given n non-negative integers w₁, W2, ..., wn and a non-negative integer T, determine if there exists a subset I C {1,2,..., n} such that Σετ W; = T.
Show that SUBSET SUM is NP.
Show that SUBSET SUM is NP.