Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems
离散数学
2007-05-23 v1 计算复杂性
摘要
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.
引用
@article{arxiv.cs/0503083,
title = {Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems},
author = {Gabriel Istrate},
journal= {arXiv preprint arXiv:cs/0503083},
year = {2007}
}
备注
A revised version of this paper will appear in Discrete Applied Mathematics