Partition Problem - Hard Instances

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:

    Do not human beings have a hard service on earth, and are not their days like the days of a laborer? Like a slave who longs for the shadow, and like laborers who look for their wages, so I am allotted months of emptiness, and nights of misery are apportioned to me.
    Bible: Hebrew, Job 7:1-3.

    The report reflects incredibly terrible judgments, shockingly sparse concern for human life, instances of officials lacking the courage to exercise the responsibilities of their high office and some very bewildering thought processes.
    Jane Jarrell Smith, U.S. widow of American astronaut Michael J. Smith. As quoted in Newsweek magazine, p. 13 (June 30, 1986)