Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story

Electronic Notes in Discrete Mathematics

Volumn 16, Issue , 2003, Pages 15-20

  Gao, Yong ^a   Culberson, Joseph ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17744387393     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(04)00460-3     Document Type: Article

References (11)

1. Mitchell D.: Resolution complexity of random constraints. In: Proceedings Principles and Practices of Constraint Programming - CP 2002, Springer (2002) 295-309
2. Kirousis L., P. Kranakis, D. Krizanc, Y. Stamation: Approximating the unsatisfiability threshold of random formulas. Random Structures and Algorithms 12(3) (1994) 253-269
3. Achlioptas D. A survey of lower bounds for random 3-sat via differential equations. Theoretical Computer Science 265 (2001) 159-185
4. Dubois O. Upper bounds on the satisfiability threshold. Theoretical Computer Science 265 (2001) 187-197
5. Molloy M.: Models and thresholds for random constraint satisfaction problems. In: Proceedings of the 34th ACM Symposium on Theory of Computing, ACM Press (2002) 209-217
6. Achlioptas D., L. M. Kirousis, E. Kranakis, D. Krizanc, M. Molloy, Y. C. Stamation: Random constraint satisfaction: A more accurate picture. In: Proceedings of CP97, Springer (1997) 107-120
7. Gent I., MacIntyre E., Prosser P., Smith B., and Walsh T. Random constraint satisfaction: Flaws and structure. CONSTRAINTS 6 (2001) 345-372
8. Xu K., Li W.: Many hard examples in exact phase transitions with applications to generating hard satisfiable instances. personal communication (2003)
9. Franco J., and Gelder A.V. A perspective on certain polynomial-time solvable classes of satisfiability. Discrete Applied Mathematics 125 (2003) 177-214
10. Friedman J., Goerdt A.: Recognizing more unsatisfiable random k-sat instances efficiently. In: Lecture Notes in Computer Science 2076, Springer (2001) 310-321
11. Karonski M., and Luczak T. The phase transition in a random hypergraph. J. Comput. Appl. Math 142 (2002) 125-135