In computer science, the partition problem is the task of deciding whether a given multiset of positive integers can be partitioned into two subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the numbers in S2. Although the partition problem is NP-complete, there is a pseudo-polynomial time dynamic programming solution, and there are heuristics that solve the problem in many instances, either optimally or approximately. For this reason, it has been called "The Easiest Hard Problem".
There is an optimization version of the partition problem, which is to partition the multiset "S" into two subsets S1, S2 such that the difference between the sum of elements in S1 and the sum of elements in S2 is minimized.
Read more about Partition Problem: Examples, Pseudo-polynomial Time Algorithm, Special Case of The Subset-sum Problem, Hard Instances, The k-partition Problem, Alternative Forms of The Problem, See Also
Famous quotes containing the word problem:
“If we parents accept that problems are an essential part of life’s challenges, rather than reacting to every problem as if something has gone wrong with universe that’s supposed to be perfect, we can demonstrate serenity and confidence in problem solving for our kids....By telling them that we know they have a problem and we know they can solve it, we can pass on a realistic attitude as well as empower our children with self-confidence and a sense of their own worth.”
—Barbara Coloroso (20th century)