Sciweavers

Share
RSA
2006

The satisfiability threshold for randomly generated binary constraint satisfaction problems

9 years 8 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models are robust in the sense that they exhibit a non-trivial threshold of satisfiability, and we determine the asymptotic order of that threshold. We also provide resolution complexity lower bounds for these models. One of our results immediately yields a theorem regarding homomorphisms between two random graphs.
Alan M. Frieze, Michael Molloy
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2006
Where RSA
Authors Alan M. Frieze, Michael Molloy
Comments (0)
books