Revision as of 04:47, 28 September 2020 edit 103.28.86.161 (talk) →Example ← Previous edit		Revision as of 05:04, 28 September 2020 edit undo Khemu Dhakal (talk \| contribs) 1 edit →Example Next edit →
Line 10: The set ''S'' = { 20, 23, 25, 49, 45, 27, 40, 22, 19 } can be partitioned into the three sets { 20, 25, 45 }, { 23, 27, 40 }, { 49, 22, 19 } each of which sum to ''T'' = 90. Another example; The set "''S"'' = {1, 2, 3, 4, 5, 6, 7, 8, 9} can be partitioned into the three sets {1, 5, 9}, {3, 4, 8}, {2, 6, 7} each of which sum to "''T"'' = 15. ==Strong NP-completeness==

3-partition problem: Difference between revisions