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 …

We introduce and study the random “locked” constraint satisfaction problems. When
increasing the density of constraints, they display a broad “clustered” phase in which the …

The typical complexity of constraint satisfaction problems (CSPs) can be investigated by
means of random ensembles of instances. The latter exhibit many threshold phenomena …

Random constraint satisfaction problems undergo several phase transitions as the ratio
between the number of constraints and the number of variables is varied. When this ratio …

The standard models used to generate random binary constraint satisfaction problems are
described. At the problem sizes studied experimentally, a phase transition is seen as the …

This paper analyzes the resolution complexity of two random constraint satisfaction problem
(CSP) models (ie Model RB/RD) for which we can establish the existence of phase …

Phase transitions in combinatorial problems have recently been shown to be useful in
locating" hard" instances of combinatorial problems. The connection between computational …

We study the entropy landscape of solutions for the bicoloring problem in random graphs, a
representative difficult constraint satisfaction problem. Our goal is to classify which types of …

An instance of a random constraint satisfaction problem defines a random subset 𝒮 (the set
of solutions) of a large product space XN (the set of assignments). We consider two …

We determine the exact freezing threshold, rf, for a family of models of random boolean
constraint satisfaction problems, including NAE-SAT and hypergraph 2-colouring, when the …