论文信息 - Statistical Mechanics of an NP-complete Problem: Subset Sum

Statistical Mechanics of an NP-complete Problem: Subset Sum

We study the statistical properties of an NP-complete problem, the subset sum, using the methods and concepts of statistical mechanics. The problem is a generalization of the number partitioning problem, which is also an NPcomplete problem and has been studied in the physics literature. The asymptotic expressions for the number of solutions are obtained. These results, applied to the number partitioning problem as a special case, are compared with those which were previously obtained by a different method. We discuss the limit of applicability of the techniques of statistical mechanics to the present problem.

H. Nishimori | T. Sasamoto | T. Toyoizumi

[1] R. Monasson,et al. Statistical Mechanics of the K--Satisfiability Model , 1996, cond-mat/9606215.

[2] Christos H. Papadimitriou,et al. Computational complexity , 1993 .

[3] M. Mézard,et al. A replica analysis of the travelling salesman problem , 1986 .

[4] M. Mézard,et al. Spin Glass Theory and Beyond , 1987 .

[5] S. Mertens. Phase Transition in the Number Partitioning Problem , 1998, cond-mat/9807077.

[6] 西森秀稔. Statistical physics of spin glasses and information processing : an introduction , 2001 .

[7] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[8] Alexander K. Hartmann,et al. Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs , 2001, Physical review letters.

[9] Miss A.O. Penney. (b) , 1974, The New Yale Book of Quotations.

[10] Mertens. Random costs in combinatorial optimization , 1999, Physical review letters.

[11] P. Anderson,et al. Application of statistical mechanics to NP-complete problems in combinatorial optimisation , 1986 .

[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13] J. Fontanari,et al. PROBABILISTIC ANALYSIS OF THE NUMBER PARTITIONING PROBLEM , 1998, adap-org/9801002.