Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems

Simple item page
dc.creatorIstrate, Gabriel
dc.date2005-03-29
dc.date.accessioned2026-07-07T03:22:47Z
dc.date.available2026-07-07T03:22:47Z
dc.descriptionWe 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.
dc.descriptionA revised version of this paper will appear in Discrete Applied Mathematics
dc.identifierhttps://arxiv.org/abs/cs/0503083
dc.identifierhttp://arxiv.org/abs/cs/0503083
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32686
dc.subjectDiscrete Mathematics
dc.subjectComputational Complexity
dc.titleCoarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems
dc.typetext

Files

Collections

arXiv