Computer Science – Discrete Mathematics
Scientific paper
2005-03-29
Computer Science
Discrete Mathematics
A revised version of this paper will appear in Discrete Applied Mathematics
Scientific paper
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.
No associations
LandOfFree
Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-439189