Abstract
Purchase PDF (226 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (1)
Purchase PDF (161 K)
> 0 and for some range of values of 
doi:10.1016/j.tcs.2006.01.001 
Copyright © 2006 Elsevier B.V. All rights reserved.
Received 15 November 2004;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
This paper analyzes the resolution complexity of two random constraint satisfaction problem (CSP) models (i.e. Model RB/RD) for which we can establish the existence of phase transitions and identify the threshold points exactly. By encoding CSPs into CNF formulas, it is proved that almost all instances of Model RB/RD have no tree-like resolution proofs of less than exponential size. Thus, we not only introduce new families of CSPs and CNF formulas hard to solve, which can be useful in the experimental evaluation of CSP and SAT algorithms, but also propose models with both many hard instances and exact phase transitions. Finally, conclusions are presented, as well as a detailed comparison of Model RB/RD with the Hamiltonian cycle problem and random 3-SAT, which, respectively, exhibit three different kinds of phase transition behavior in NP-complete problems.
Keywords: Constraint satisfaction problem (CSP); Random problems; Resolution complexity; Phase transitions; SAT
