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:
“Friendship is not so simple. It is hard to get and takes a long time, but when one ha it one cannot get rid of it, one has to face it.”
—Albert Camus (1913–1960)
“Our Last Will and Testament, providing for the only future of which we can be reasonably certain, namely our own death, shows that the Will’s need to will is no less strong than Reason’s need to think; in both instances the mind transcends its own natural limitations, either by asking unanswerable questions or by projecting itself into a future which, for the willing subject, will never be.”
—Hannah Arendt (1906–1975)