Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-439189

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.