1
$\begingroup$

Given a set of integers S (positive and negative, may contain duplicates) can S be divided into three disjoint subsets that all sum to the same value? Prove this problem is NP-complete.


Is it possible to show directly that Subset Sum $\le_p$ 3-Partition, or would I have to do

Subset Sum $\le_p$ Partition $\le_p$ 3-Partition?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.