Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances

Theoretical Computer Science

Volumn 320, Issue 2-3, 2004, Pages 345-372

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

^a CNRS   (France)

Author keywords

Analysis of algorithms; Backtrack; Satisfiability

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; STATISTICAL METHODS; TREES (MATHEMATICS);

ANALYSIS OF ALGORITHMS; BACKTRACK RESOLUTION; SATISFIABILITY;

HEURISTIC METHODS;

EID: 2442641940     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.02.034     Document Type: Article

References (37)

1. Achlioptas D. Lower bounds for random 3-SAT via differential equations. Theoret. Comput. Sci. 265:2001;159-185.
2. D. Achlioptas, P. Beame, M. Molloy, A sharp threshold in proof complexity, in: Proc. STOC 01, 2001, pp. 337-346.
3. Achlioptas D., Kirousis L., Kranakis E., Krizanc D. Rigorous results for random (2+p)-SAT. Theoret. Comput. Sci. 265:2001;109-129.
4. P. Beame, R. Karp, T. Pitassi, M. Saks, ACM Symp. on Theory of Computing (STOC98) Assoc. Comput. Mach., New York, 1998, pp. 561-571.
5. Chao M.T., Franco J. Probabilistic analysis of two heuristics for the 3-satisfiability problem. SIAM J. Comput. 15:1986;1106-1118.
6. Chao M.T., Franco J. Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem. Inform. Sci. 51:1990;289-314.
7. Chvàtal V., Szmeredi E. Many hard examples for resolution. J. ACM. 35:1988;759-768.
8. C. Coarfa, D.D. Dernopoulos, A. San Miguel Aguirre, D. Subramanian, M.Y. Vardi, Random 3-SAT: The plot thickens, in: R. Dechter (Ed.), Proc. Principles and Practice of Constraint Programming (CP'2000), Lecture Notes in Computer Science, Vol. 1894, 2000, pp. 143-159.
9. Cocco S., Monasson R. Trajectories in phase diagrams, growth processes and computational complexity. how search algorithms solve the 3-Satisfiability problem Phys. Rev. Lett. 86:2001;1654 Cocco S., Monasson R. Analysis of the computational complexity of solving random satisfiability problems using branch and bound search algorithms. Eur. Phys. J. B. 22:2001;505.
10. Cocco S., Monasson R. Trajectories in phase diagrams, growth processes and computational complexity. how search algorithms solve the 3-Satisfiability problem Phys. Rev. Lett. 86:2001;1654 Cocco S., Monasson R. Analysis of the computational complexity of solving random satisfiability problems using branch and bound search algorithms. Eur. Phys. J. B. 22:2001;505.
11. Cocco S., Monasson R. 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. Phys. Rev. E. 66:2002;037101.
12. J. Crawford, L. Auton, Experimental results on the cross-over point in satisfiability problems, Proc. 11th National Conf. on Artificial Intelligence (AAAI-93), The AAAI Press/MIT Press, Cambridge, MA, 1993, pp. 21-27; Artif. Intell. 81 (1996).
13. J. Crawford, L. Auton, Experimental results on the cross-over point in satisfiability problems, Proc. 11th National Conf. on Artificial Intelligence (AAAI-93), The AAAI Press/MIT Press, Cambridge, MA, 1993, pp. 21-27; Artif. Intell. 81 (1996).
14. Davis M., Logemann G., Loveland D. A machine program for theorem proving. Commun. ACM. 5:1962;394-397.
15. O. Dubois, Y. Boufkhad, J. Mandler, Typical random 3-SAT formulae and the satisfiability threshold, Proc. of the 11th annual ACM-SIAM Symposium on Discrete Algorithms (SODA). San Francisco, California, USA, January 9-11, 2000, pp. 126-127.
16. O. Dubois, R. Monasson, B. Selman, R. Zecchina (Eds.), Phase transitions in combinatorial problems, Theoret. Comput. Sci. 265 (2001).
17. Ein-Dor L., Monasson R. The dynamics of proving uncolorability of large random graphs. J. Phys. A. 36:2003;11055.
18. Franco J. Results related to thresholds phenomena research in satisfiability. lower bounds Theoret. Comput. Sci. 265:2001;147-157.
19. Friedgut E. Sharp thresholds of graph properties, and the k-sat problem. J. Amer. Math. Soc. 12:1999;1017.
20. Frieze A., Suen S. Analysis of two simple heuristics on a random instance of k-SAT. J. Algorithms. 20:1996;312-335.
21. I. Gent, H. van Maaren, T. Walsh (Eds.), SAT2000: Highlights of satisfiability research in the year 2000, Frontiers in Artificial Intelligence and Applications, Vol. 63, IOS Press, Amsterdam, 2000.
22. Gent I.P., Walsh T. Easy problems are sometimes hard. Artif. Intell. 70:1994;335-345.
23. Gomes C.P., Selman B., Crato N., Kautz H. J. Automat. Reasoning. 24:2000;67.
24. J. Gu, P.W. Purdom, J. Franco, B.W. Wah, Algorithms for satisfiability (SAT) problem: a survey, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 35, American Mathematical Society, Providence, RI, 1997, pp. 19-151.
25. Hartmann A., Weigt M. Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs. Phys. Rev. Lett. 86:2001;1658.
26. T. Hogg, B.A. Huberman, C. Williams (Eds.), Frontiers in problem solving: phase transitions and complexity, Artificial Intelligence, Vols. 81, I and II, Elsevier Science, Essex, UK, 1996.
27. H. Jia, C. Moore, How much backtracking does it take to 3-color a random graph? preprint (2003).
28. Kaporis A.C., Kirousis L.M., Lalas E.G. The probabilistic analysis of a greedy satisfiability algorithm. ESA. 2002;574-585.
29. D.E. Knuth, The art of computer programming, Vol. 1: Fundamental Algorithms, Section 2.2.1, Addison-Wesley, New York, 1968.
30. A. McKane, M. Droz, J. Vannimenus, D. Wolf (Eds.), Scale invariance, interfaces, and non-equilibrium dynamics, NATO ASI Ser. B: Physics, Vol. 344, Plenum Press, New-York, 1995.
31. D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems, Proc. Tenth National Conf. on Artificial Intelligence (AAAI-92), The AAAI Press/MIT Press, Cambridge, MA, 1992, pp. 440-446.
32. R. Monasson, On the analysis of backtrack procedures for the coloring of random graphs, in: E. Ben-Naim, H. Frauenfelder, Z. Torczkai (Eds.), Complex Networks, Springer, Berlin, 2004.
33. Monasson R., Zecchina R., Kirkpatrick S., Selman B., Troyansky L. Determining computational complexity from characteristic 'phase transitions'. Nature. 400:1999;133-137 Monasson R., Zecchina R., Kirkpatrick S., Selman B., Troyansky L. 2+p-SAT. relation of typical-case complexity to the nature of the phase transition Random Structure and Algorithms. 15:1999;414.
34. Monasson R., Zecchina R., Kirkpatrick S., Selman B., Troyansky L. Determining computational complexity from characteristic 'phase transitions'. Nature. 400:1999;133-137 Monasson R., Zecchina R., Kirkpatrick S., Selman B., Troyansky L. 2+p-SAT. relation of typical-case complexity to the nature of the phase transition, Random Structure and Algorithms. 15:1999;414.
35. Montanari A., Zecchina R. Optimizing searches via rare events. Phys. Rev. Lett. 88:2002;178701.
36. Selman B., Kirkpatrick S. Critical behavior in the satisfiability of random Boolean expressions. Science. 264:1994;1297-1301.
37. Wormald N. Differential equations for random processes and random graphs. Ann. Appl. Probab. 5:1995;1217-1235.