Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions

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

Volumn 66, Issue 3, 2002, Pages

  Cocco, Simona ^a   Monasson, Rémi ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DENSITY (SPECIFIC GRAVITY); DIFFERENTIAL EQUATIONS; HAMILTONIANS; INTEGRAL EQUATIONS; MARKOV PROCESSES; PROBLEM SOLVING; RATE CONSTANTS;

DENSITY OF PARTICLES; MEAN SQUARED DISPLACEMENT (MSD); NON-MARKOVIAN RANDOM PROCESSES; RANDOM WALKS;

RANDOM PROCESSES;

ARTICLE;

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

References (22)

1. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982).
2. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, Nature (London) 400, 133 (1999).
3. S. Cocco and R. Monasson, Phys. Rev. Lett. 86, 1654 (2001);
4. S. CoccoR. MonassonEur. Phys. J. B 22, 505 (2001).
5. S. Mertens, Phys. Rev. Lett. 81, 4281 (1998);
6. Phys. Rev. Lett.S. Mertens84, 1347 (2000).
7. M. Weigt and A. Hartmann, Phys. Rev. Lett. 84, 6118 (2000);
8. Phys. Rev. Lett.M. WeigtA. Hartmann86, 1658 (2001).
9. J. Gu, P.W. Purdom, J. Franco, and B.W. Wah, in DIMACS Series on Discrete Mathematics and Theoretical Computer Science (American Mathematical Society, Providence, 1997), Vol. 35, pp. 19–151.
10. D. Mitchell, B. Selman, and H. Levesque, in Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92) (AAAI Press, Cambridge, MA, 1992), pp. 440–446.
11. T. Hogg and C.P. Williams, Artif. Intel. 69, 359 (1994);
12. Artif. Intel.I.P. Gent and T. Walsh, 70, 335 (1994);
13. Artif. Intel.B. Selman and S. Kirkpatrick, 81, 273 (1996).
14. B. Selman and S. Kirkpatrick, Science 264, 1297 (1994).
15. E. Friedgut, J. Am. Math. Soc. 12, 1017 (1999).
16. V. Chvàtal, E. Szmeredi, J. Assoc. Comput. Mach. 35, 759 (1988).
17. C. Coarfa, D.D. Dernopoulos, A. San Miguel Aguirre, D. Subramanian, and M.Y. Vardi, Lect. Notes Comput. Sci. 1894, 143 (2000).
18. M.T. Chao and J. Franco, Inf. Sci. (N.Y.) 51, 289 (1990).
19. A. Frieze and S. Suen, J. Algorithms20, 312 (1996).
20. O. Dubois, P. André, Y. Boufkhad, and J. Carlier, in DIMACS Series in Discrete Math and Computer Science (Ref. 6), pp. 415–436;
21. C.P. Gomes, B. Selman, N. Crato, and H. Kautz, J. Automated Reasoning24, 67 (2000).
22. A. Montanari, R. Zecchina, Phys. Rev. Lett. 88, 178701 (2002).