Talk:3-partition problem

From Wikipedia, the free encyclopedia

I believe there is a mistake in this article. the 3-partition problem is about partitioning a multiset into three partition. the problem presented here is obviously not NPC, it is in fact P. you made my friend believe he proved P=NP :)

Nope. the problem is stated precisely like this in Garey&Johnson, problem SP15. The Wikipedia article just leaves out an additional constraint (all numbers between B/4 and B/2 where B is the desired weight of all the partitions), but this doesn't affect the hardness. 88.73.61.8 09:27, 1 July 2007 (UTC)