The Partition problem 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 independent subsets such that the sums of the numbers in each subset are equal?" In complexity theory, the NP-complete problems are the most difficult problems in NP, in the sense that they are the ones most likely not to be in P. The reason is that if you could find a way to solve an NP-complete problem quickly, then you could use... Computer science - Wikipedia, the free encyclopedia /**/ @import /skins-1. ...