Question: Define PARTITION as the problem that takes a set S = {s 1 , s 2 ,...,s n } of numbers and asks whether there
Define PARTITION as the problem that takes a set S = {s1, s2,...,sn} of numbers and asks whether there is a subset T of S such that

That is, it asks whether there is a partition of the numbers into two groups that sum to the same value. Show that PARTITION is NP-complete.
Si Si s;ET S;ES-T
Step by Step Solution
3.45 Rating (161 Votes )
There are 3 Steps involved in it
To show that PARTITION is in NP note that we can guess a partition of the set of numbe... View full answer
Get step-by-step solutions from verified subject matter experts
