Revision as of 09:48, 7 December 2024 edit 128.179.182.161 (talk) another typo ← Previous edit		Revision as of 00:27, 28 April 2025 edit undo Lorax (talk \| contribs) Extended confirmed users 10,010 edits Adding short description: "Strongly NP-complete problem in computer science" Tag: Shortdesc helper Next edit →
Line 1: {{Short description\|Strongly NP-complete problem in computer science}} The '''3-partition problem''' is a [[Strong NP-completeness\|strongly NP-complete]] problem in [[computer science]]. The problem is to decide whether a given [[multiset]] of integers can be partitioned into triplets that all have the same sum. More precisely:

3-partition problem: Difference between revisions