Many hard examples for resolution
Journal of the ACM (JACM)
A sharp threshold for k-colorability
Random Structures & Algorithms
A sharp threshold in proof complexity
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Rigorous results for random (2 + p)-SAT
Theoretical Computer Science - Phase transitions in combinatorial problems
Threshold phenomena in random graph colouring and satisfiability
Threshold phenomena in random graph colouring and satisfiability
Hard and easy distributions of SAT problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Bayes networks for estimating the number of solutions to a CSP
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Resolution Complexity of Random Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Generalized satisfiability problems: minimal elements and phase transitions
Theoretical Computer Science
Combinatorial sharpness criterion and phase transition classification for random CSPs
Information and Computation
Annals of Mathematics and Artificial Intelligence
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Random Structures & Algorithms
Resolution complexity of random constraint satisfaction problems: another half of the story
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Threshold properties of random boolean constraint satisfaction problems
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Many hard examples in exact phase transitions
Theoretical Computer Science
Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
Artificial Intelligence
On Random Ordering Constraints
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Consistency and random constraint satisfaction models
Journal of Artificial Intelligence Research
Resolution complexity of random constraint satisfaction problems: Another half of the story
Discrete Applied Mathematics
Threshold properties of random boolean constraint satisfaction problems
Discrete Applied Mathematics
On random betweenness constraints
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
On random betweenness constraints
Combinatorics, Probability and Computing
On the phase transitions of random k-constraint satisfaction problems
Artificial Intelligence
Phase transition of tractability in constraint satisfaction and bayesian network inference
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
A general model and thresholds for random constraint satisfaction problems
Artificial Intelligence
An algorithm for random signed 3-SAT with intervals
Theoretical Computer Science
| Hi-index | 0.00 |
We introduce a class of models for random Constraint Satisfaction Problems. This class includes and generalizes many previously studied models. We characterize those models from our class which exhibit thresholds for satisfiability in the sense that the limiting probability of satisfiability changes significantly as the number of constraints increases. We also discuss models which exhibit sharp thresholds in the sense that the limiting probability jumps from 0 to 1 suddenly.