Summarizing CSP Hardness with Continuous Probability Distributions

Abstract

We present empirical evidence that the distribution of eeort required to solve CSPs randomly generated at the 50% satissable 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.

Extracted Key Phrases

Statistics

051015'98'00'02'04'06'08'10'12'14'16
Citations per Year

102 Citations

Semantic Scholar estimates that this publication has 102 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Frost1997SummarizingCH, title={Summarizing CSP Hardness with Continuous Probability Distributions}, author={Daniel Frost and Irina Rish and Llu{\'i}s Vila}, booktitle={AAAI/IAAI}, year={1997} }