Random formulas have frozen variables
D Achlioptas, F Ricci-Tersenghi - SIAM Journal on Computing, 2009 - SIAM
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 …
random graph and hypergraph coloring, there exist very good estimates of the largest …
On the solution-space geometry of random constraint satisfaction problems
D Achlioptas, F Ricci-Tersenghi - Proceedings of the thirty-eighth annual …, 2006 - dl.acm.org
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 …
random graph/hypergraph coloring, there are very good estimates of the largest constraint …
Solution clustering in random satisfiability
D Achlioptas - The European Physical Journal B, 2008 - Springer
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 …
random graph and hypergraph coloring, we have very good estimates of the largest …
Frozen variables in random boolean constraint satisfaction problems
M Molloy, R Restrepo - Proceedings of the Twenty-Fourth Annual ACM-SIAM …, 2013 - SIAM
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 …
constraint satisfaction problems, including NAE-SAT and hypergraph 2-colouring, when the …
Constraint satisfaction by survey propagation
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 …
constraint satisfiability problems. It has been successfully tested on random 3-SAT and …
On the solution‐space geometry of random constraint satisfaction problems
D Achlioptas, A Coja‐Oghlan… - Random Structures & …, 2011 - Wiley Online Library
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 …
largest constraint density for which solutions exist and the largest density for which any …
Random constraint satisfaction problems
A Coja-Oghlan - arXiv preprint arXiv:0911.2322, 2009 - arxiv.org
Random instances of constraint satisfaction problems such as k-SAT provide challenging
benchmarks. If there are m constraints over n variables there is typically a large range of …
benchmarks. If there are m constraints over n variables there is typically a large range of …
Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
D Achlioptas, C Moore - SIAM Journal on Computing, 2006 - SIAM
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 …
from solubility to insolubility when the constraint density passes through a critical threshold …
The condensation transition in random hypergraph 2-coloring
A Coja-Oghlan, L Zdeborová - Proceedings of the twenty-third annual ACM …, 2012 - SIAM
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 …
graph or hypergraph coloring, the best current estimates of the threshold for the existence of …
Reconstruction and clustering in random constraint satisfaction problems
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 …
known algorithms when the number of constraints per variable lies in a certain interval …