Exact Phase Transitions in Random Constraint Satisfaction Problems
Artificial Intelligence
2007-05-23 v1 Computational Complexity
Discrete Mathematics
Abstract
In this paper we propose a new type of random CSP model, called Model RB, which is a revision to the standard Model B. It is proved that phase transitions from a region where almost all problems are satisfiable to a region where almost all problems are unsatisfiable do exist for Model RB as the number of variables approaches infinity. Moreover, the critical values at which the phase transitions occur are also known exactly. By relating the hardness of Model RB to Model B, it is shown that there exist a lot of hard instances in Model RB.
Cite
@article{arxiv.cs/0004005,
title = {Exact Phase Transitions in Random Constraint Satisfaction Problems},
author = {Ke Xu and Wei Li},
journal= {arXiv preprint arXiv:cs/0004005},
year = {2007}
}
Comments
See http://www.jair.org/ for any accompanying files