The Easiest Hard Problem: Number Partitioning
摘要
Number partitioning is one of the classical NP-hard problems of combinatorial optimization. It has applications in areas like public key encryption and task scheduling. The random version of number partitioning has an "easy-hard" phase transition similar to the phase transitions observed in other combinatorial problems like -SAT. In contrast to most other problems, number partitioning is simple enough to obtain detailled and rigorous results on the "hard" and "easy" phase and the transition that separates them. We review the known results on random integer partitioning, give a very simple derivation of the phase transition and discuss the algorithmic implications of both phases.
引用
@article{arxiv.cond-mat/0310317,
title = {The Easiest Hard Problem: Number Partitioning},
author = {Stephan Mertens},
journal= {arXiv preprint arXiv:cond-mat/0310317},
year = {2007}
}
备注
8 pages, to appear in A.G. Percus, G. Istrate and C. Moore, eds., Computational Complexity and Statistical Physics (Oxford University Press, New York, 2004)