Summarizing CSP Hardness with Continuous Probability Distributions

We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be approximated by two standard families of continuous probability distribution functions. Solvable problems can be modelled by the Weibull distribution, and unsolvable problems by the lognormal distribution. These distributions t equally well over a variety of backtracking based algorithms.

• Type: Conference
• Year: 1997
• Where: AAAI
• Authors: Daniel Frost, Irina Rish, Lluís Vila
• Keywords: AAAI 1997, Backtracking Algorithm, Continuous Probability Distribution, Intelligent Agents, Satis Able Point