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. More precisely:
* The input to the problem is a multiset S of n = 3 m positive integers. The sum of all integers is m T.
* The output is whether or not there exists a partition of S into m triplets S1, S2, …, Sm such that the sum of the numbers in each one is equal to T. The S1, S2, …, Sm must form a partition of S in the sense that they are disjoint and they cover S.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
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. More precisely:
* The input to the problem is a multiset S of n = 3 m positive integers. The sum of all integers is m T.
* The output is whether or not there exists a partition of S into m triplets S1, S2, …, Sm such that the sum of the numbers in each one is equal to T. The S1, S2, …, Sm must form a partition of S in the sense that they are disjoint and they cover S.
has abstract
En ciencias de la computación, ...... subconjuntos, con igual suma.
@es
O Problema das 3 Partições é u ...... ubconjuntos, com a soma igual.
@pt
The 3-partition problem is a s ...... strictly between T/4 and T/2.
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,025,741,212
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
En ciencias de la computación, ...... ue están disjuntos y cubren S.
@es
O Problema das 3 Partições é u ...... onter exatamente três elemento
@pt
The 3-partition problem is a s ...... are disjoint and they cover S.
@en
label
3-partition problem
@en
Problema das 3 Partições
@pt
Problema de la 3-partición
@es