The Partition problem is weakly NP-complete: Given a set A of positive integers, can A be partitioned into two disjoint subsets with the same sum?
I'm interested in the hardness of this variant:
Partition problem: Given a set A of positive integers, can A be partitioned into three disjoint subsets with the same sum?
Is this variant strongly NP-complete?