Constraint satisfaction problems with isolated solutions are hard

@article{Zdeborov2008ConstraintSP,
title={Constraint satisfaction problems with isolated solutions are hard},
author={Lenka Zdeborov{\'a} and Marc M{\'e}zard},
journal={CoRR},
year={2008},
volume={abs/0810.1499}
}

We study the phase diagram and the algorithmic hardness of the random ‘locked’ constraint satisfaction problems, and compare them to the commonly studied ‘non-locked’ problems like satisfiability of Boolean formulae or graph coloring. The special property of the locked problems is that clusters of solutions are isolated points. This simplifies significantly the determination of the phase diagram, which makes the locked problems particularly appealing from the mathematical point of view. On the… CONTINUE READING