Models and thresholds for random constraint satisfaction problems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 209-217

  Molloy, Michael ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES; STATISTICAL METHODS;

LIMITING PROBABILITY; RANDOM CONSTRAINT SATISFACTION PROBLEMS;

COMPUTATION THEORY;

EID: 0036036680     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509939.509941     Document Type: Conference Paper

References (20)

1. A sharp threshold in proof complexity
2. A threshold for k-colourability
3. Rigorous results for random (2 + p)-SAT
4. Random constraint satisfaction: A more accurate picture
5. Where the really hard problems are
6. Many hard examples for resolution
7. On the evolution of random graphs
8. Sharp thresholds of graph properties and the k-SAT problem
9. Random constraint satisfaction: Flaws and structure
10. The phase transition behaviour of maintaining arc consistency
11. The transitive closure of a random digraph
12. Bayes networks for estimating the number of solutions to a CSP
13. Hard and easy distributions of SAT problems
14. An empirical study of phase transitions in binary constraint satisfaction problems