An average analysis of backtracking on random constraint satisfaction problems

Annals of Mathematics and Artificial Intelligence

Volumn 33, Issue 1, 2001, Pages 21-37

  Xu, Ke ^a   Li, Wei ^a  

^a BEIHANG UNIVERSITY   (China)

Author keywords

Analysis of algorithms; Average complexity; Backtracking algorithms; CSP

Indexed keywords

EID: 0035643599     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1012328830929     Document Type: Article

References (18)

1. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, M.S.O. Molloy and Y.C. Stamatiou, Random constraint satisfaction: A more accurate picture, in: Proc. of 3rd International Conference on Principles and Practice of Constraint Programming (CP-97) (Springer, 1997) pp. 107-120, submitted to Constraints.
2. K.M. Bugrara, On the average case analysis of some satisfiability model problems, Information Sciences 40 (1986) 21-37.
3. M.T. Chao and J. Franco, Probabilistic analysis of a generalization of the unit-clause literal selection heuristic for the k-satisfiability problem, Information Sciences 51 (1990) 289-314.
4. P. Cheeseman, B. Kanefsky and W. Taylor, Where the really hard problems are, in: Proceedings of IJCAI-91 (1991) pp. 331-337.
5. R. Dechter, Constraint satisfaction, in: MIT Encyclopedia of the Cognitive Sciences (MITECS) (January 1998) ftp://ftp.ics.uci.edu/pub/CSP-repository/papers/R68.ps.
6. J. Franco, On the probabilistic performance of algorithms for the satisfiability problem, Information Processing Letters 23 (1986) 103-106.
7. I.P. Gent, E. MacIntyre, P. Prosser, B.M. Smith and T. Walsh, Random constraint satisfaction: Flaws and structure, submmited to Constraints, http://www.cs.strath.edu.uk/~apes/apereports.html.
8. T. Hogg, Refining the phase transition in combinatorial search, Artificial Intelligence 81 (1996) 127-154.
9. D.E. Knuth, The Art of Computer Programming, Vol. 1 (Addison-Wesley, Reading, MA, 1975).
10. G. Kondrak and P.V. Beek, A theoretical valuation of selected algorithms, Artificial Intelligence 89 (1997) 365-387.
11. D. Mitchell, B. Selman and H. Levesque, Hard and easy distributions of SAT problems, in: Proceedings of AAAI-92 (1992) pp. 459-465.
12. P. Prosser, An empirical study of phase transitions in binary constraint satisfaction problems, Artificial Intelligence 81 (1996) 81-109.
13. P.W. Purdom, Backtracking and random constraint satisfaction, Annals of Mathematics and Artificial Intelligence 20 (1997) 393-410.
14. P.W. Purdom and C.A. Brown, An average time analysis of backtracking, SIAM Journal on Computing 10 (1981) 583-593.
15. P.W. Purdom and C.A. Brown, Polynomial-average-time satisfiability problems, Information Sciences 41 (1987) 23-42.
16. B.M. Smith and M.E. Dyer, Locating the phase transition in binary constraint satisfaction problems, Artificial Intelligence 81 (1996) 155-181.
17. C. Williams and T. Hogg, Exploiting the deep structure of constraint problems, Artificial Intelligence 70 (1994) 73-117.
18. K. Xu and W. Li, Exact phase transitions in random constraint satisfaction problems, Journal of Artificial Intelligence Research 12 (2000) 93-103, http://www.jair.org/.