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 …

For a large number of random constraint satisfaction problems, such as random k-SAT and
random graph and hypergraph coloring, there exist very good estimates of the largest …

For a number of random constraint satisfaction problems, such as random k-SAT and
random graph/hypergraph coloring, there are very good estimates of the largest constraint …

Many NP-complete constraint satisfaction problems appear to undergo a “phase transition”
from solubility to insolubility when the constraint density passes through a critical threshold …

Survey Propagation is an algorithm designed for solving typical instances of random
constraint satisfiability problems. It has been successfully tested on random 3-SAT and …

Random k-SAT is the single most intensely studied example of a random constraint
satisfaction problem. But despite substantial progress over the past decade, the threshold for …

For a large number of random constraint satisfaction problems, such as random k-SAT and
random graph and hypergraph coloring, we have very good estimates of the largest …

For many random constraint satisfaction problems such as random satisfiability or random
graph or hypergraph coloring, the best current estimates of the threshold for the existence of …

For various random constraint satisfaction problems there is a significant gap between the
largest constraint density for which solutions exist and the largest density for which any …

Random instances of constraint satisfaction problems (CSPs) appear to be hard for all
known algorithms when the number of constraints per variable lies in a certain interval …