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 …

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 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 …

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 …

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 …

We consider the random regular k-nae-sat problem with n variables each appearing in
exactly d clauses. For all k exceeding an absolute constant k 0, we establish explicitly the …

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 …

For many random constraint satisfaction problems, by now there exist asymptotically tight
estimates of the largest constraint density for which solutions exist. At the same time, for …

We formalize the class of “sequential local algorithms" and show that these algorithms fail to
find satisfying assignments on random instances of the “Not-All-Equal-K-SAT”(NAE-K-SAT) …