A physicist's approach to number partitioning

Authors
Citation
S. Mertens, A physicist's approach to number partitioning, THEOR COMP, 265(1-2), 2001, pp. 79-108
Citations number
33
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORETICAL COMPUTER SCIENCE
ISSN journal
03043975 → ACNP
Volume
265
Issue
1-2
Year of publication
2001
Pages
79 - 108
Database
ISI
SICI code
0304-3975(20010828)265:1-2<79:APATNP>2.0.ZU;2-3
Abstract
The statistical physics approach to the number partioning problem, a classi cal NP-hard problem, is both simple and rewarding. Very basic notions and m ethods from statistical mechanics are enough to obtain analytical results f or the phase boundary that separates the "easy-to-solve" from the "hard-to- solve" phase of the NPP as well as for the probability distributions of the optimal and sub-optimal solutions. In addition, it can be shown that solvi ng a number partioning problem of size N to some extent corresponds to loca ting the minimum in an unsorted list of O(2(N)) numbers. Considering this c orrespondence it is not surprising that known heuristics for the partitioni ng problem are not significantly better than simple random search. (C) 2001 Elsevier Science B.V. All rights reserved.