Phase transition and finite-size scaling for the integer partitioning problem

Random Structures and Algorithms

Volumn 19, Issue 3-4, 2001, Pages 247-288

  Borgs, Christian ^a   Chayes, Jennifer ^a   Pittel, Boris ^b  

^a MICROSOFT RESEARCH   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035539876     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10004     Document Type: Article

References (26)

1. N. Alon and G. Freiman, On sums of subsets of a set of integers, Combinatorica 8 (1988), 297-306.
2. B. Bollobás, The evolution of random graphs, Trans Amer Math Soc 286 (1984), 257-274.
3. B. Bollobás, C. Borgs, J.T. Chayes, J.-H. Kim, and D.B. Wilson, The scaling window of the 2-SAT transition, Rand Struc Alg 18 (2001), 201-256.
4. C. Borgs, J.T. Chayes, and B. Pittel, Sharp threshold and scaling window for the integer partitioning problem.
5. M. Chaimovich and G. Freiman, Solving dense subset-sum problems by using analytical number theory, J Complexity 5 (1989), 271-282.
6. B. Derrida, Phys Rev E 24 (1981), 2613.
7. R. Durrett, Probability: Theory and examples, Wadsworth and Brooks/Cole, Pacific Grove, CA, 1991.
8. P. Erdos and A. Rényi, On the evolution of random graphs, Magyar Tud Akad Mat Kutató Int Kozl 5 (1960), 17-61.
9. P. Erdos and A. Rényi, On the evolution of random graphs, Bull Inst Internat Statist 38 (1961), 343-347.
10. F.F. Ferreira and J.F. Fontanari, Probabilistic analysis of the number partitioning problem, J Phys A: Math Gen 31 (1998), 3417-3428.
11. F.F. Ferreira and J.F. Fontanari, Statistical mechanics analysis of the continuous number partitioning problem, Physica A 269 (1999), 54-60.
12. G.A. Freiman, An analytical method of analysis of linear Boolean equations, Ann NY Acad Sci 337 (1980), 97-102.
13. E. Friedgut, Sharp thresholds of graph properties and the k-sat problem, J AMS 12 (1999), 1017-1054.
14. Y. Fu, in Lectures in the Science of Complexity, D.L. Stein (Editor), Addison-Wesley, Reading, MA, 1989.
15. H.L. Furst and R. Kannan, Succinct certificates for almost all subset sum problems, SIAM J Comput 18 (1989), 550-558.
16. I.P. Gent and T. Walsh, Proc ECAI-96, W. Wahlster (Editor), Wiley, New York, 1996, pp. 170-174.
17. R. Graham, Bounds on multiprocessing timing anomalies, SIAM J Appl Math 17 (1969), 416-429.
18. S. Janson, D. Knuth, T. Łuczak, and B. Pittel, The birth of the giant component, Rand Struc Alg 4 (1994), 231-358.
19. N. Karmarkar and R.M. Karp, The differencing method of set partitioning (1982), Technical Report UCB/CSD 82/113, Computer Science Division (EECS), University of California, Berkeley.
20. N. Karmarkar, R.M. Karp, G.S. Lueker, and A.M. Odlyzko, Probabilistic analysis of optimum partitioning, J Appl Prob 23 (1986), 626-645.
21. T. Łuczak, Component behavior near the critical point of the random graph process, Rand Struc Alg 1 (1990), 287-310.
22. G.S. Lueker, Exponentially small bounds on the expected optimum of the partition and subset sum problem, Rand Struc Alg 12 (1998), 51-62.
23. S. Mertens, Phase transition in the number partitioning problem, Phys Rev Lett 81 (1998), 4218-4221.
24. S. Mertens, Random Costs in Combinatorial Optimization, Phys Rev Lett 84 (2000), 1347-1350.
25. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, Determining computational complexity from characteristic 'phase transitions', Nature 400 (1999), 133-138.
26. B. Yakir, The differencing algorithm LDM for partitioning: a proof of a conjecture of Karmarkar and Karp, Math Oper Res 21 (1996), 85-99.