Phase Transition in the Number Partitioning Problem

Abstract

Number partitioning is an $\mathrm{NP}$-complete problem of combinatorial optimization. A statistical mechanics analysis reveals the existence of a phase transition that separates the easy- from the hard-to-solve instances and that reflects the pseudopolynomiality of number partitioning. The phase diagram and the value of the typical ground-state energy are calculated.