3 research outputs found
Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems
We study threshold properties of random constraint satisfaction problems
under a probabilistic model due to Molloy. We give a sufficient condition for
the existence of a sharp threshold that leads (for boolean constraints) to a
necessary and sufficient for the existence of a sharp threshold in the case
where constraint templates are applied with equal probability, solving thus an
open problem of Creignou and Daude.Comment: A revised version of this paper will appear in Discrete Applied
Mathematic
Sharp thresholds for constraint satisfaction problems and homomorphisms
We determine under which conditions certain natural models of random
constraint satisfaction problems have sharp thresholds of satisfiability. These
models include graph and hypergraph homomorphism, the -model, and
binary constraint satisfaction problems with domain size three