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:
“It is quite gratifying to feel guilty if you haven’t done anything wrong: how noble! Whereas it is rather hard and certainly depressing to admit guilt and to repent.”
—Hannah Arendt (1906–75)
“There are few instances of the exercise of particular virtues which seem harder to attain to, or which appear more amiable and engaging in themselves, than those of moderation and the forgiveness of injuries.”
—Laurence Sterne (1713–1768)