1. The set ${\displaystyle S=\{20,23,25,30,49,45,27,30,30,40,22,19\}}$  can be partitioned into the four sets ${\displaystyle \{20,25,45\},\{23,27,40\},\{49,22,19\},\{30,30,30\}}$ , each of which sums to T = 90.
2. The set ${\displaystyle S=\{1,2,5,6,7,9\}}$  can be partitioned into the two sets ${\displaystyle \{1,5,9\},\{2,6,7\}}$  each of which sum to T = 15.
3. (every integer in S is strictly between T/4 and T/2): ${\displaystyle S=\{4,5,5,5,5,6\}}$ , thus m=2, and T=15. There is feasible 3-partition ${\displaystyle \{4,5,6\},\{5,5,5\}}$ .
4. (every integer in S is strictly between T/4 and T/2): ${\displaystyle S=\{4,4,4,6,6,6\}}$ , thus m=2, and T=15. There is no feasible solution.

The 3-partition problem remains NP-complete even when the integers in S are bounded above by a polynomial in n. In other words, the problem remains NP-complete even when representing the numbers in the input instance in unary. i.e., 3-partition is NP-complete in the strong sense or strongly NP-complete. This property, and 3-partition in general, is useful in many reductions where numbers are naturally represented in unary.

The 3-partition problem is similar to the partition problem, in which the goal is to partition S into two subsets with equal sum, and the multiway number partitioning, in which the goal is to partition S into k subsets with equal sum, where k is a fixed parameter. In 3-Partition the goal is to partition S into m = n/3 subsets, not just a fixed number of subsets, with equal sum. Partition is "easier" than 3-Partition: while 3-Partition is strongly NP-hard, Partition is only weakly NP-hard - it is hard only when the numbers are encoded in non-unary system, and have value exponential in n. When the values are polynomial in n, Partition can be solved in polynomial time using the pseudopolynomial time number partitioning algorithm.

In the unrestricted-input variant, the inputs can be arbitrary integers; in the restricted-input variant, the inputs must be in (T/4, T/2). The restricted version is as hard as the unrestricted version: given an instance S_u of the unrestricted variant, construct a new instance of the restricted version S_r ≔ {s + 2 T  | s ∈ S_u}. Every solution of S_u corresponds to a solution of S_r but with a sum of 7 T  instead of T, and every element of S_r is in [2 T , 3 T ] which is contained in ( T /4, 7 T /2).

In the distinct-input variant, the inputs must be in (T/4, T/2), and in addition, they must all be distinct integers. It, too, is as hard as the unrestricted version.^[1]

In the unrestricted-output variant, the m output subsets can be of arbitrary size - not necessarily 3 (but they still need to have the same sum T). The restricted-output variant can be reduced to the unrestricted-variant: given an instance S_r of the restricted variant, with 3m items summing up to mT, construct a new instance of the unrestricted variant S_u ≔ {s + 2T | s ∈ S_r}, with 3m items summing up to 7mT, and with target sum 7 T . Every solution of S_r naturally corresponds to a solution of S_u. Conversely, in every solution of S_u, since the target sum is 7 T  and each element is in ( T /4, 7 T /2), there must be exactly 3 elements per set, so it corresponds to a solution of S_r.

The ABC-partition problem (also called numerical 3-d matching) is a variant in which, instead of a set S with 3 m  integers, there are three sets A, B, C with m integers in each. The sum of numbers in all sets is ${\displaystyle mT}$ . The goal is to construct m triplets, each of which contains one element from A, one from B and one from C, such that the sum of each triplet is T.^[2]

The 4-partition problem is a variant in which S contains n = 4 m  integers, the sum of all integers is ${\displaystyle mT}$ , and the goal is to partition it into m quadruplets, all with a sum of T. It can be assumed that each integer is strictly between T/5 and T/3. Similarly, ABCD-parititon is a variant of 4-partition in which each there are 4 input sets and each quadruplet should contain one element from each set.

Garey and Johnson (1975) originally proved 3-Partition to be NP-complete, by a reduction from 3-dimensional matching.^[3] The classic reference by Garey and Johnson (1979) describes an NP-completeness proof, reducing from 3-dimensional matching to 4-partition to 3-partition.^[4] Logically, the reduction can be partitioned into several steps.

Reduction from 3d-matching to ABCD-partition edit

We are given an instance of E of 3d-matching, containing some m triplets {w_i,x_j,y_k}, where the vertices are w₁,...,w_q and x₁,...,x_q and y₁,...,y_q. We construct an instance of ABCD-partition as follows (where r := 32q):

• For each triplet t = {w_i,x_j,y_k} in E, the set A contains an element u_t = 10r⁴-kr³-jr²-ir.
• For each triplet t = {w_i,x_j,y_k} in E, the set B contains w_it, C contains x_jt, and D contains y_kt. So for each of w_i, x_j, y_k, there may be many corresponding elements in B, C, D - one for each triplet in which they appear. We consider one of these elements (denoted by "1") as the "real" one, and the others as "dummy" ones. The element sizes are as follows:
  • w_i[1] = 10r⁴+ir; w_i[2+] = 11r⁴+ir.
  • x_j[1] = 10r⁴+jr²; x_j[2+] = 11r⁴+jr².
  • y_k[1] = 10r⁴+kr³; y_k[2+] = 8r⁴+kr³.
• The sum of every three "real" elements or every three "dummy" elements is 30r⁴+ir+jr²+kr³; and of the triplet element is added, the sum is 40r⁴.
• The threshold for the ABCD-partition instance is T=40r⁴. Note that the size of each element is in (T/3,T/5).

Given a perfect matching in E, we construct a 4-partition of ABCD as follows:

• For each triplet t= {w_i,x_j,y_k} in the matching, we construct a 4-set {u_t, w_i[1], x_j[1], y_k[1]}.
• For each triplet not in the matching, we construct a similar 4-set, but with the corresponding dummy elements.

In both cases, the sum of the 4-set is 40r⁴ as needed.

Given a partition of ABCD, the sum of each 4-set is 40r⁴. Therefore, the terms with r, r² and r³ must cancel out, and the terms with r⁴ must sum up to 40r⁴; so the 4-set must contain a triplet and 3 matching "real" elements, or a triplet and 3 matching "dummy" elements. From the triplets with the 3 matching "real" elements, we construct a valid perfect matching in E.

Note that, in the above reduction, the size of each element is polynomial in the input size; hence, this reduction shows that ABCD-partition is strongly NP-hard.

Reduction from ABCD-partition to 4-partition edit

Given an instance of ABCD-partition with m elements per set, threshold T, and sum mT, we construct an instance of 4-partition with 4m elements:

• For each element a in A, the corresponding element has size 16a+1;
• For each element b in B, the corresponding element has size 16b+2;
• For each element c in C, the corresponding element has size 16c+4;
• For each element d in D, the corresponding element has size 16d+8.

All in all, the sum is 16mT+15m, and the new threshold is 16T+15.

Every ABCD-partition corresponds naturally to a 4-partition. Conversely, in every 4-partition, the sum modulo 16 is 15, and therefore it must contain exactly one item with size modulo 16 = 1, 2, 4, 8; this corresponds to exactly one item from A, B, C, D, from which we can construct an ABCD-partition.

Using a similar reduction, ABC-partition can be reduced to 3-partition.

Reduction from 4-partition to 3-partition edit

We are given an instance A of 4-partition: 4m integers, a₁,...,a_4m, each of which in the range (T/3,T/5), summing up to mT. We construct an instance B of 3-partition as follows:

• For each a_i in A, B contains a "regular" element w_i = 4*(5T+a_i)+1. All in all there are 4m regular elements, summing up to 81mT + 4m.
• For each pair of elements a_i,a_j in A, B contains two "pairing" elements: u_ij = 4*(6T - a_i - a_j)+2 and u_ij' = 4*(5T + a_i + a_j)+2. All in all there are 4m*(4m-1) pairing elements, summing up to (88mT+16m)*(4m-1).
• Additionally, B contains 8m²-3m "filler" elements, with size 20T, and total sum (8m²-3m)*20T.
• All in all, B contains 24m²-3m = 3(8m²-m) elements, with sum (64T+4)*(8m²-m).
• The threshold for the 3-partition instance is 64T+4; note that the sizes of all elements in B are in (16T+1,32T+2).

Given a 4-partition of A, we construct a 3-partition for B as follows:

• For each 4-set {a₁,a₂,a₃,a₄} with sum T, we construct a 3-set {w₁,w₂,u₁₂} with sum 4*(5T+a₁+5T+a₂+6T-a₁-a₂)+1+1+2=64T+4 and another 3-set {w₃,w₄,u₁₂'} with sum 4*(5T+a₃+5T+a₄+5T+a₁+a₂)+1+1+2=64T+4. These sets contain all 4m regular elements and 2m matching pairs of pairing elements.
• From the remaining elements, we construct 3-sets {u_ij,u_ij',filler} with sum 4*(6T-a_i-a_j+5T+a_i+a_j+5T)+2+2=64T+4.

Conversely, given a 3-partition of B, the sum of each 3-set is a multiple of 4, so it must contain either two regular items and one pairing item, or two pairing items and one filler item:

• If a 3-set contains two pairing items u_ij, u_kl and one filler item, then the sum of the two pairing items must be 44T+4 = 4*(5T+6T)+2+2, so they must have matching sizes (a_i+a_j=a_k+a_l). Therefore, by replacing as needed, we can assume that the two pairing items are in fact u_ij and u_ij'. Therefore, the remaining pairing items also consist of n matching pairs.
• Therefore, the remaining 3-sets can be partitioned into two groups: n 3-sets containing the items u_ij, and n 3-sets containing the items u_ij'. In each matching pair of 3-sets, the sum of the two pairing items u_ij+u_ij' is 44T+4, so the sum of the four regular items is 84T+4. Therefore, from the four regular items, we construct a 4-set in A, with sum T.

The NP-hardness of 3-partition was used to prove the NP-hardness rectangle packing, as well as of Tetris^[5][6] and some other puzzles,^[7] and some job scheduling problems.^[8]