Relaxation in graph coloring and satisfiability problems

Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

Volumn 59, Issue 4, 1999, Pages 3983-3999

  Svenson, Pontus ^a   Nordahl, Mats G ^a,b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b SANTA FE INSTITUTE   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000757560     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.59.3983     Document Type: Article

References (64)

1. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Science 220, 671 (1983).
2. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, J. Chem. Phys. 21, 1087 (1953).
3. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, Oper. Res. 39, 378 (1991).
4. Y. Fu and P. W. Anderson, J. Phys. A 19, 1605 (1986).
5. T. Hogg and B. A. Huberman, Phys. Rep. 156, 227 (1987).
6. T. Hogg, in Annual Reviews of Computational Physics (World Scientific, Singapore, 1995), Vol. 2, pp. 357–406.
7. S. Kirkpatrick and B. Selman, Science 264, 1297 (1994).
8. J. Inoue, J. Phys. A 30, 1047 (1997).
9. K. Y. M. Wong, D. Sherrington, P. Mottishaw, R. Dewar, and C. De Dominicis, J. Phys. A 21, L99 (1988).
10. P. Varga, Phys. Rev. E 57, 6487 (1998).
11. D. S. Dean and G. Parisi, J. Phys. A 31, 3949 (1998).
12. F. F. Ferreira and J. F. Fontanari, J. Phys. A 31, 3417 (1998).
13. S. Mertens, Phys. Rev. Lett. 81, 4281 (1998).
14. M. J. Oméro, M. Dzierzawa, M. Marsili, and Y.-C. Zhang, J. Phys. I 7, 1723 (1997).
15. S. Higuchi, Phys. Rev. E 58, 128 (1998).
16. B. Eynard and C. Kristjansen, Nucl. Phys. B 516, 529 (1998).
17. P. D. Francesco, B. Eynard, and E. Guitter, Nucl. Phys. B 516 [FS], 543 (1998).
18. A. J. Bray, Adv. Phys. 43, 357 (1994).
19. D. E. Knuth, Sorting and Searching, 2nd ed., The Art of Computer Programming, Vol. 3 (Addison-Wesley, Reading, Massachusetts, 1998).
20. J. E. Hopcroft and J. D. Ulman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Reading, Massachusetts, 1979).
21. A. Dewdney, The Turing Omnibus (Computer Science Press, Rockville, 1989).
22. C. H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).
23. M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness (W. H. Freeman, New York, 1979).
24. C. F. Baillie, D. A. Johnston, and J. P. Kownacki, Nucl. Phys. B 432, 551 (1994).
25. D. A. Johnston and P. Plechác̆, J. Phys. A 30, 7349 (1997).
26. S. A. Cook, in Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (ACM, New York, 1971), pp. 151–158.
27. P. Cheeseman, B. Kanefsky, and W. M. Taylor, in Proceedings of IJCAI-91 (Morgan Kauffman, San Mateo, California, 1991), pp. 331–337.
28. T. Hogg, B. A. Huberman, and C. P. Williams, Artif. Intel. 81, 1 (1996).
29. C. P. Williams and T. Hogg, in Proceedings of AAAI92 (AAAI Press, Menlo Park, CA, 1992), pp. 472–477;in Proceedings of AAAI93 (AAAI Press, Menlo Park, CA, 1993), pp. 152–157
30. Artif. Intel. 70, 73 (1994).
31. E. Friedgut, Necessary and Sufficient Conditions for Sharp Thresholds of Graph Properties, and the k-SAT Problem, available at http://www.ma.huji.ac.il/(Formula presented)ehudf/
32. D. Achlioptas and E. Friedgut, A Sharp Threshold for k-Colorability, available at http://www.ma.huji.ac.il/(Formula presented)ehudf/
33. T. Hogg and C. P. Williams, Artif. Intel. 69, 359 (1994).
34. D. Mitchell, B. Selman, and H. Levesque, in Proceedings of AAAI-92 (AAAI Press, San José, California, 1992), pp. 459–465.
35. R. Monasson and R. Zecchina, Phys. Rev. Lett. 76, 3881 (1996)
36. R. Monasson and R. Zecchina, Phys. Rev. E 56, 1357 (1997)
37. R. Monasson, J. Phys. A 31, 513 (1998)
38. R. Monasson and R. Zecchina, e-print cond-mat/9810008.
39. M. Mézard, G. Parisi, and M. A. Virasoro, Spin Glass Theory and Beyond (World Scientific, Singapore, 1987).
40. I. P. Gent and T. Walsh, Artif. Intel. 88, 349 (1996).
41. I. P. Gent, E. MacIntyre, P. Prosser, and T. Walsh, in Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference (MIT Press, Boston, 1996), Vol. 1, pp. 246–52.
42. I. P. Gent and T. Walsh, Report No. APES 05-1998, available at http://www.cs.strath.ac.uk/(Formula presented)apes/apereports.html
43. L. M. Kirousis, E. Kranakis, D. Krizanc, and Y. C. Stamatiou, Random Struct. Algorithms 12, 253 (1998).
44. A. Frieze and S. Suen, J. Algorithms 20, 312 (1996).
45. B. Bollobás, Random Graphs (Academic Press, New York, 1985).
46. K. Binder and A. P. Young, Rev. Mod. Phys. 58, 801 (1986).
47. G. R. Schreiber and O. C. Martin, e-print cond-mat/9804027.
48. G. S. Grest, C. M. Soukoulis, and K. Levin, Phys. Rev. Lett. 56, 1148 (1986).
49. R. Kühn, Y.-C. Lin, and G. Köppel, e-print cond-mat/9805137.
50. D. E. Knuth, Seminumerical Algorithms, 3rd ed., The Art of Computer Programming Vol. 2 (Addison-Wesley, Reading, MA, 1997).
51. I. P. Gent and T. Walsh, J. Artif. Intel. Res. 1, 47 (1993).
52. D. A. Clark, in Principles and Practice of Constraint Programming (Springer-Verlag, Berlin, 1996), pp. 119–33.
53. D. Brelaz, Commun. ACM 22, 251 (1979).
54. P. Svenson and M. G. Nordahl (unpublished).
55. A. J. Bray, B. Derrida, and C. Godrèche, Europhys. Lett. 27, 175 (1994).
56. B. Derrida, J. Phys. A 28, 1481 (1995).
57. G. Arfken, Mathematical Methods for Physicists, 3rd ed. (Academic Press, Boston, 1985).
58. Z. W. Lai, G. F. Mazenko, and O. T. Valls, Phys. Rev. B 37, 9481 (1988).
59. J. D. Shore, M. Holzer, and J. P. Sethna, Phys. Rev. B 46, 11 376 (1992).
60. F. Ritort, Phys. Rev. Lett. 75, 1190 (1995).
61. J. Villain, Phys. Rev. Lett. 52, 1543 (1984).
62. G. Grinstein and J. F. Fernandez, Phys. Rev. B 29, 6389 (1984).
63. C. Godrèche, J. P. Bouchaud, and M. Mézard, J. Phys. A 28, L603 (1995).
64. M. Campellone, B. Coluzzi, and G. Parisi, Phys. Rev. B 58, 12 081 (1998).