Minimizing energy below the glass thresholds

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 70, Issue 3 2, 2004, Pages

  Battaglia, Demian ^a   Kolář, Michal ^a   Zecchina, Riccardo ^b  

^a SISSA   (Italy)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER SCIENCE; GROUND STATE; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; SIMULATED ANNEALING;

DECIMATION ENERGY; GLASS THRESHOLDS; OPTIMAL GROUND STATES; PROTEIN FOLDING;

ALGORITHMS;

EID: 42749101451     PISSN: 15393755     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.70.036107     Document Type: Article

References (50)

1. J.-P. Bouchaud, L. F. Cugliandolo, J. Kurchan, and M. Mézard, in Spin Glasses and Random Fields, edited by A. P. Young (World Scientific, Singapore, 1997).
2. H. Frauenfelder, P. G. Wolynes, and R. H. Austin, Rev. Mod. Phys. 71, S419 (1999); V. S. Pande, A. Y. Grosberg, and T. Tanaka, ibid. 72, 259 (2000).
3. H. Frauenfelder, P. G. Wolynes, and R. H. Austin, Rev. Mod. Phys. 71, S419 (1999); V. S. Pande, A. Y. Grosberg, and T. Tanaka, ibid. 72, 259 (2000).
4. M. Blatt, S. Wiseman, and E. Domany, Phys. Rev. Lett. 76, 3251 (1996).
5. A. K. Hartmann and H. Rieger, Optimization Algorithms in Physics (Wiley-VCH, Berlin, 2001).
6. A. K. Hartmann and H. Rieger, New and Advanced Optimization Algorithms in Physics and Computational Science (Wiley-VCH, Berlin, 2004).
7. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Science 220, 671 (1983).
8. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs. NJ, 1982).
9. Theor. Comput. Sci. 265, Issue 1-2 (2001), special issue on NP-Hardness and Phase Transitions, edited by O. Dubois, R. Monasson, B. Selman, and R. Zecchina.
10. T. Hogg, B. A. Huberman, and C. Williams, Artif. Intell. 81, 1 (1996).
11. D. A. Spielman, Lect. Notes Comput. Sci. 1279, 67 (1997).
12. T. Richardson and R. Urbanke, in Codes, Systems, and Graphical Models, edited by B. Marcus and J. Rosenthal (Springer, New York, 2001).
13. N. Sourlas, Nature (London) 339, 693 (1989).
14. N. Ajtai, Electronic Colloquium on Computational Complexity Report No. TR96-007, 1996.
15. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyanski, Nature (London) 400, 133 (1999).
16. M. Mézard, G. Parisi, and R. Zecchina, Science 297, 812 (2002) (Sciencexpress, published online 27 June 2002; 10.1126/science.1073287).
17. S. Cocco, R. Monasson, A. Montanari, and G. Semerjian, e-print cs.CC/0302003.
18. M. Mézard and R. Zecchina, Phys. Rev. E 66, 056126 (2002).
19. A. Braunstein, M. Mézard, and R. Zecchina, e-print cs.CC/ 0212002.
20. A. Montanari and F. Ricci-Tersenghi, e-print cond-mat/0401649.
21. R. Motwani and P. Raghavan, Randomized Algorithms (Cambridge University Press, Cambridge, 2000).
22. G. Semerjian and R. Monasson, e-print cond-mat/0301272.
23. W. Barthel, A. K. Hartmann, and M. Weigt, e-print cond-mat/ 0301271.
24. G. Parisi, e-print cond-mat/0308510.
25. B. Selman, H. Kautz, and B. Cohen, Proc. AAAI-94 (AAAI Press, Seattle, WA, 1994), 337-343.
26. M. R. Garey and D. S. Johnson, Computers and Intractability (Freeman, New York, 1979).
27. S. Kirkpatrick and B. Selman, Science, 264, 1297 (1994).
28. E. Friedgut, J. Am. Math. Soc. 12, 1017 (1999).
29. O. Dubois, Y. Boufkhad, and J. Mandler, Proeedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 2000); A. Kaporis, L. Kirousis, and E. Lalas, Proceedings of the 4th European Symposium on Algorithms (ESA, 2002), Lecture Notes in Computer Science (Springer, New York, in press).
30. O. Dubois, Y. Boufkhad, and J. Mandler, Proeedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 2000); A. Kaporis, L. Kirousis, and E. Lalas, Proceedings of the 4th European Symposium on Algorithms (ESA, 2002), Lecture Notes in Computer Science (Springer, New York, in press).
31. F. Guerra, Commun. Math. Phys. 233, 1 (2003); S. Franz and M. Leone, J. Stat. Phys. 111, 535 (2003).
32. F. Guerra, Commun. Math. Phys. 233, 1 (2003); S. Franz and M. Leone, J. Stat. Phys. 111, 535 (2003).
33. J. Franco, Theor. Comput. Sci. 265, 147 (2001); D. Achlioptas and G. Sorkin, 41st Annual Symposium on Foundations of Computer Science (IEEE Computer Society Press, Los Alamitos, CA, 2000).
34. J. Franco, Theor. Comput. Sci. 265, 147 (2001); D. Achlioptas and G. Sorkin, 41st Annual Symposium on Foundations of Computer Science (IEEE Computer Society Press, Los Alamitos, CA, 2000).
35. D. Achlioptas and C. Moore (unpublished).
36. D. Achlioptas, U. Noar, and Y. Peres, extended abstract FOCS'03, pp. 362-370 (unpublished).
37. H. Karlo and U. Zwick, Proceedings of the 38th FOCS (IEEE Computer Press, Miami Beach, FL, 1997), pp. 406-415.
38. U. Schöning, Algorithmica 32, 615 (2002).
39. M. Alekhnovich and E. Ben-Sasson (unpublished).
40. A. J. Parkes, Lect. Notes Comput. Sci. 2470, 708 (2002).
41. S. Mertens, M. Mézard, and R. Zecchina, e-print, cs.CC/0309020.
42. G. Biroli, R. Monasson, and M. Weigt, Eur. Phys. J. B 14, 551 (2000).
43. G. Parisi, e-print cs.CC/0301015.
44. A. Montanari, G. Parisi, and F. Ricci-Tersenghi, J. Phys. A 37, 2073 (2004).
45. A. Z. Broder, A. M. Frieze, and E. Upfal, Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM Press, Austin, TX, 1993), p. 322.
46. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, IEEE Trans. Inf. Theory 47, 498 (2002).
47. A. V. Lopatin and L. B. Ioffe, Phys. Rev. B 66, 174202 (2002).
48. S. Seitz and P. Orponen, Proceedings of the LICS'03 Workshop on Typical Case Complexity and Phase Transitions, Ottawa, Canada, 2003; Electronic Notes in Discrete Mathematics (Elsevier, Amsterdam, 2003), Vol. 16.
49. S. Seitz and P. Orponen, Proceedings of the LICS'03 Workshop on Typical Case Complexity and Phase Transitions, Ottawa, Canada, 2003; Electronic Notes in Discrete Mathematics (Elsevier, Amsterdam, 2003), Vol. 16.
50. Download site: www.ictp.trieste.it/~zecchina/SP