Number partitioning as a random energy model

Journal of Statistical Mechanics: Theory and Experiment

Volumn , Issue 4, 2004, Pages

  Bauke, Heiko ^a   Franz, Silvio ^b   Mertens, Stephan ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

^b ABDUS SALAM INTERNATIONAL CENTRE FOR THEORETICAL PHYSICS   (Italy)

Author keywords

disordered systems (theory); energy landscapes (theory); heuristics

Indexed keywords

EID: 34547695083     PISSN: None     EISSN: 17425468     Source Type: Journal    
DOI: 10.1088/1742-5468/2004/04/P04003     Document Type: Article

References (31)

1. Kirkpatrick S and Sherrington D 1978 Infinite-range models of spin-glasses Phys. Rev. B 17 4384
2. Derrida B 1981 Random-energy model: an exactly solvable model of disordered systems Phys. Rev. B 24 2613
3. Gross D J and Mézard M 1984 The simplest spin glass Nucl. Phys. B 240 431
4. Mertens S 2000 Random costs in combinatorial optimization Phys. Rev. Lett. 84 1347
5. Stadler P F, Hordijk W and Fontanari J F 2003 Phase transition and landscape statistics of the number partitioning problem Phys. Rev. E 67 056701
6. Borgs C, Chayes J and Pittel B 2001 Phase transition and finite-size scaling for the integer partitioning problem Random Struct. Algorithms 19 247
7. Coffman E G and Lueker G S 1991 Probabilistic Analysis of Packing and Partitioning Algorithms (New York: Wiley)
8. Tsai L-H 1992 Asymptotic analysis of an algorithm for balanced parallel processor scheduling SIAM J. Comput. 21 59
9. Merkle R C and Hellman M E 1978 Hiding informations and signatures in trapdoor knapsacks IEEE Trans. Inf. Theory 24 525
10. Odlyzko A M 1991 The rise and fall of knapsack cryptosystems PSAM: Proc. 42nd Symp. in Applied Mathematics (Providence, RI: American Mathematical Society)
11. Hayes B 2002 Computing science: the easiest hard problem Am. Sci. 90 113
12. Garey M R and Johnson D S 1997 Computers and intractability A Guide to the Theory of NP-Completeness (New York: Freeman)
13. Mertens S 2002 Computational complexity for physicists Comput. Sci. Eng. 4 31
14. Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A and Protassi M 1999 Complexity and Approximation (Berlin: Springer)
15. Fu Y 1989 The use and abuse of statistical mechanics in computational complexity Lectures in the Sciences of Complexity vol 1 ed D L Stein (Reading, MA: Addison-Wesley) pp 815-26
16. Ferreira F F and Fontanari J F 1998 Probabilistic analysis of the number partitioning problem J. Phys. A: Math. Gen. 31 3417
17. Mertens S 1998 Phase transition in the number partitioning problem Phys. Rev. Lett. 81 4281
18. Sasamoto T, Toyoizumi T and Nishimori H 2001 Statistical mechanics of an NP-complete problem: subset sum J. Phys. A: Math. Gen. 34 9555
19. Gent I P and Walsh T 1996 Phase transitions and annealed theories: number partitioning as a case study Proc. ECAI-96 ed W Wahlster (New York: Wiley) pp 170-4
20. Dubois O, Monasson R, Selman B and Zecchina R (ed) 2001 Phase transitions in combinatorial problems Theor. Comput. Sci. 265
21. Mézard M 2003 Passing messages between disciplines Science 301 1685
22. Horowitz E and Sahni S 1974 Computing partitions with applications to the Knapsack problem J. Assoc. Comput. Mach. 21 277
23. Franz S and Parisi G 1997 Phase diagram of coupled glassy systems: a mean-field study Phys. Rev. Lett. 79 2486
24. Franz S and Parisi G 1998 Effective potential in glassy systems: theory and simulations Physica A 261 317
25. Mertens S 2004 The easiest hard problem: number partitioning Computational Complexity and Statistical Physics ed A G Percus, G Istrate and C Moore (New York: Oxford University Press) [cond-mat/0302536]
26. Junier I and Kurchan J 2004 Microscopic realizations of the trap model J. Phys. A: Math. Gen. 37 3945 [cond-mat/0311158]
27. Bauke H, Mertens S and Engel A 2003 Phase transition in multiprocessor scheduling Phys. Rev. Lett. 90 158701
28. Galambos J 1987 The Asymptotic Theory of Extreme Order Statistics (Malabar, FL: Krieger)
29. Graham R L, Knuth D E and Patashnik O 1994 Concrete Mathematics: a Foundation for Computer Science 2nd edn (Reading, MA: Addison-Wesley)
30. Johnson D S, Aragon C R, McGeoch L A and Schevron C 1991 Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning Oper. Res. 39 378
31. Ruml W, Ngo J T, Marks J and Shieber S M 1996 Easily searched encodings for number partitioning J. Optim. Theory Appl. 89 251