Hard Instances
Sets with only one, or no partitions tend to be hardest (or most expensive) to solve compared to their input sizes. When the values are small compared to the size of the set, perfect partitions are more likely. The problem is known to undergo a "phase transition"; being likely for some sets and unlikely for others. If m is the number of bits needed to express any number in the set and n is the size of the set then tends to have many solutions and tends to have few or no solutions. As n and m get larger, the probability of a perfect partition goes to 1 or 0 respectively. This was originally argued based on empiricial evidence by Gent and Walsh, then using methods from statistical physics by Mertens, and later proved by Borgs, Chayes, and Pittel.
Read more about this topic: Partition Problem
Famous quotes containing the words hard and/or instances:
“Dogmatic theological statements are neither logical propositions nor poetic utterances. They are “shaggy dog” stories; they have a point, but he who tries too hard to get it will miss it.”
—W.H. (Wystan Hugh)
“The prime lesson the social sciences can learn from the natural sciences is just this: that it is necessary to press on to find the positive conditions under which desired events take place, and that these can be just as scientifically investigated as can instances of negative correlation. This problem is beyond relativity.”
—Ruth Benedict (1887–1948)