Many hard examples for resolution
Journal of the ACM (JACM)
Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Constructing an asymptotic phase transition in random binary constraint satisfaction problems
Theoretical Computer Science - Phase transitions in combinatorial problems
Models and thresholds for random constraint satisfaction problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A probabilistic analysis of randomly generated binary constraint satisfaction problems
Theoretical Computer Science
Generalized satisfiability problems: minimal elements and phase transitions
Theoretical Computer Science
Combinatorial sharpness criterion and phase transition classification for random CSPs
Information and Computation
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Random Structures & Algorithms
Many hard examples in exact phase transitions
Theoretical Computer Science
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
The Resolution Complexity of Random Constraint Satisfaction Problems
SIAM Journal on Computing
Mick gets some (the odds are on his side) (satisfiability)
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
On the satisfiability threshold of formulas with three literals per clause
Theoretical Computer Science
Exact phase transitions in random constraint satisfaction problems
Journal of Artificial Intelligence Research
Consistency and random constraint satisfaction models
Journal of Artificial Intelligence Research
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
On the phase transitions of random k-constraint satisfaction problems
Artificial Intelligence
Two hardness results on feedback vertex sets
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
A note on treewidth in random graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Large hinge width on sparse random hypergraphs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
| Hi-index | 0.00 |
In this paper, we study the relation among the parameters in their most general setting that define a large class of random CSP models d-k-CSP where d is the domain size and k is the length of the constraint scopes. The model d-k-CSP unifies several related models such as the model RB and the model k-CSP. We prove that the model d-k-CSP exhibits exact phase transitions if klnd increases no slower than the logarithm of the number of variables. A series of experimental studies with interesting observations are carried out to illustrate the solubility phase transition and the hardness of instances around phase transitions.