Content deleted Content added
Adding short description: "Strongly NP-complete problem in computer science" |
Fixed Grammer in problem overview |
||
Line 3:
* Input: a multiset ''S'' containing ''n'' positive integer elements.
* Conditions: ''S'' must be partitionable into ''m'' triplets, ''S''<sub>1</sub>, ''S''<sub>2</sub>, …, ''S''<sub>''m''</sub>, where ''n = 3m''. These triplets [[Partition of a set|partition]] ''S'' in the sense that they are [[Disjoint sets|disjoint]] and they [[Cover (topology)|cover]] ''S''. The target value ''T'' is computed by taking the sum of all elements in ''S'', then
* Output: whether or not there exists a partition of ''S'' such that, for all triplets, the sum of the elements in each triplet equals ''T''.
| |||