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:
“What happened at Hiroshima was not only that a scientific breakthrough ... had occurred and that a great part of the population of a city had been burned to death, but that the problem of the relation of the triumphs of modern science to the human purposes of man had been explicitly defined.”
—Archibald MacLeish (1892–1982)