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 seems as if an age of genius must be succeeded by an age of endeavour; riot and extravagance by cleanliness and hard work.”
—Virginia Woolf (1882–1941)
“Do not be discouraged, if in a thousand instances you find your kindness rejected and wronged, your good evil-spoken of, and the hand you extend for the relief of others, cast insultingly away; the benevolence which cannot outlive these trials of its purity and strength, is not like the self-sacrifice of him, who went about doing good.”
—C., U.S. women’s magazine contributor. American Ladies Magazine, pp. 331-4 (July 1828)