{"version":"1.0","type":"link","title":"3-partition problem - Newikis","description":"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. More precisely:","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}