Landscape of solutions in constraint satisfaction problems
Disordered Systems and Neural Networks
2009-11-11 v2 Statistical Mechanics
Computational Complexity
Abstract
We present a theoretical framework for characterizing the geometrical properties of the space of solutions in constraint satisfaction problems, together with practical algorithms for studying this structure on particular instances. We apply our method to the coloring problem, for which we obtain the total number of solutions and analyze in detail the distribution of distances between solutions.
Cite
@article{arxiv.cond-mat/0507451,
title = {Landscape of solutions in constraint satisfaction problems},
author = {Marc Mezard and Matteo Palassini and Olivier Rivoire},
journal= {arXiv preprint arXiv:cond-mat/0507451},
year = {2009}
}
Comments
4 pages, 4 figures. Replaced with published version