Complexity Analysis of Heuristic CSP Search Algorithms

  • Igor Razgon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3978)


CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O *(d n ), where n and d are the number of variables and the maximal domain size of the underlying CSP, respectively.

In this paper we show that a combination of heuristic methods of constraint solving can reduce the time complexity. In particular, we prove that the FC-CBJ algorithm combined with the fail-first variable ordering heuristic (FF) achieves time complexity of O *((d – 1) n ), where n and d are the number of variables and the maximal domain size of the given CSP, respectively. Furthermore, we show that the combination is essential because neither FC-CBJ alone nor FC with FF achieve the above complexity. The proposed results are interesting because they establish connection between theoretical and practical approaches to CSP research.


Time Complexity Domain Size Partial Solution Constraint Satisfaction Problem Polynomial Factor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bacchus, F.: Extending forward checking. In: Principles and Practice of Constraint Programming, pp. 35–51 (2000)Google Scholar
  2. 2.
    Beck, J.C., Prosser, P., Wallace, R.J.: Trying again to fail-first. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS, vol. 3419, pp. 41–55. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Eppstein, D.: Improved algorithms for 3-coloring, 3-edge coloring and constraint satisfaction. In: SODA-2001, pp. 329–337 (2001)Google Scholar
  4. 4.
    Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263–313 (1980)CrossRefGoogle Scholar
  5. 5.
    Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence 9, 268–299 (1993)CrossRefGoogle Scholar
  6. 6.
    Prosser, P.: MAC-CBJ: maintaining arc consistency with conflict-directed backjumping. Technical Report Research Report/95/177, Dept. of Computer Science, University of Strathclyde (1995)Google Scholar
  7. 7.
    Woeginger, G.: Exact algorithms for NP-hard problems: A survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185–207. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Igor Razgon
    • 1
  1. 1.Computer Science DepartmentUniversity College CorkIreland

Personalised recommendations