Explore relationships

3-partition problem

The 3-partition problem is a 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.

Use + to expand a branch. Click a topic name to open its summary.