Consistency and random constraint satisfaction models with a high constraint tightness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 17-31

  Gao, Yong ^a   Culberson, Joseph ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

CONSTRAINT CONSISTENCY; HARD INSTANCES; NON-TRIVIAL; RANDOM CONSTRAINTS; RANDOM MODEL; RESOLUTION COMPLEXITY; THRESHOLD BEHAVIOR; TYPICAL CASE COMPLEXITY;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35048897061     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_5     Document Type: Article

References (15)

1. 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
2. Gent, I., MacIntyre, E., Prosser, P., Smith, B., Walsh, T.: Random constraint satisfaction: Flaws and structure. Constraints 6 (2001) 345-372
3. Gao, Y., Culberson, J.: Resolution complexity of random constraint satisfaction problems: Another half of the story. In: LICS'03 Workshop on Typical Case Complexity and Phase Transitions. (2003)
4. Molloy, M., Salavatipour, M.: The resolution complexity of random constraint satisfaction problems. In: Proceedings of FOCS 2003. (2003)
5. Xu, K., Li, W.: Exact phase transitions in random constraint satisfaction problems. Journal of Artificial Intelligence Research 12 (2000) 93-103
6. Smith, B.M.: Constructing an asymptotic phase transition in random binary constraint satisfaction problems. Theoretical Computer Science 265 (2001) 265-283
7. Chvatal, V., Szemeredi, E.: Many hard examples for resolution. Journal of the Association for Computing Machinery 35 (1988) 759-768
8. Beame, P., Karp, R.M., Pitassi, T., Saks, M.E.: On the complexity of unsatisfiability proofs for random k -CNF formulas. In: ACM Symposium on Theory of Computing. (1998) 561-571
9. Achlioptas, D., Beame, P., Molloy, M.: A sharp threshold in proof complexity. In: ACM Symposium on Theory of Computing. (2001) 337-346
10. Mitchell, D.: Resolution complexity of random constraints. In: Proceedings Principles and Practices of Constraint Programming (CP-2002), Springer (2002) 295-309
11. Beame, P., Culberson, J., Mitchell, D., Moore, C.: The resolution complexity of random graph k-colorability. Electronic Colloquium on Computational Complexity, TR04-012 (2004)
12. Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: Proceedings of International Conference on Computer Aided Design (ICCAD2001). (2001)
13. Mitchell, D.G.: The Resolution Complexity of Constraint Satisfaction. PhD thesis, Department of Computer Science, University of Toronto, Canada (2002)
14. Gao, Y., Culberson, J.: Consistency and random constraint satisfaction models. Technical Report TR04-13, Department of Computing Science, University of Alberta (2004)
15. Ben-Sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. Journal of ACM 49 (2001)