Random constraint satisfaction: Easy generation of hard (satisfiable) instances

  title={Random constraint satisfaction: Easy generation of hard (satisfiable) instances},
  author={Ke Xu and Fr{\'e}d{\'e}ric Boussemart and Fred Hemery and Christophe Lecoutre},
  journal={Artif. Intell.},
In this paper, we try to further demonstrate that the models of random CSP instances proposed by Xu and Li are of theoretical and practical interest. Indeed, these models, called RB and RD, present several nice features. First, it is quite easy to generate random instances of any arity since no particular structure has to be integrated, or property enforced, in such instances. Then, the existence of an asymptotic phase transition can be guaranteed while applying a limited restriction on domain… CONTINUE READING