Jump to content

Partition problem

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by James Aguilar (talk | contribs) at 02:31, 29 November 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Partition is an NP-Complete problem in Computer Science. The problem is to answer the question, "Given a set of integers, is there a way to divide the set into two subsets such that the sums of the numbers in each subset are equal?"