Landscape of solutions in constraint satisfaction problems
classification
❄️ cond-mat.dis-nn
cond-mat.stat-mechcs.CC
keywords
solutionsconstraintproblemssatisfactionalgorithmsanalyzeapplycharacterizing
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.