Define PARTITION as the problem that takes a set S = {s 1 , s 2 ,...,s

Question:

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 

Σ Σ Si Si s;ET S;ES-T


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.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Algorithm Design And Applications

ISBN: 9781118335918

1st Edition

Authors: Michael T. Goodrich, Roberto Tamassia

Question Posted: