Probabilistic analysis of two heuristics for the 3-satisfiability problem
SIAM Journal on Computing
Many hard examples for resolution
Journal of the ACM (JACM)
Information Sciences: an International Journal
Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A threshold for unsatisfiability
Journal of Computer and System Sciences
Tail bounds for occupancy and the satisfiability threshold conjecture
Random Structures & Algorithms
A general upper bound for the satisfiability threshold of random r-SAT formulae
Journal of Algorithms
Approximating the unsatisfiability threshold of random formulas
Random Structures & Algorithms
Length of prime implicants and number of solutions of random CNF formulae
Theoretical Computer Science
On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Bounding the unsatisfiability threshold of random 3-SAT
Random Structures & Algorithms
The scaling window of the 2-SAT transition
Random Structures & Algorithms
Results related to threshold phenomena research in satisfiability: lower bounds
Theoretical Computer Science - Phase transitions in combinatorial problems
Lower bounds for random 3-SAT via differential equations
Theoretical Computer Science - Phase transitions in combinatorial problems
A Treshold for Unsatisfiability
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract)
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Threshold values of random K-SAT from the cavity method
Random Structures & Algorithms
Typical case complexity of satisfiability algorithms and the threshold phenomenon
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Resolution complexity of random constraint satisfaction problems: another half of the story
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
Regular Random k-SAT: Properties of Balanced Formulas
Journal of Automated Reasoning
On the satisfiability threshold of formulas with three literals per clause
Theoretical Computer Science
An analysis of phase transition in NK landscapes
Journal of Artificial Intelligence Research
Resolution complexity of random constraint satisfaction problems: Another half of the story
Discrete Applied Mathematics
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Discrete Applied Mathematics
Where are the hard manipulation problems?
Journal of Artificial Intelligence Research
Diversely enumerating system-level architectures
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
We present a survey of upper bounds which has been established up to now on the satisfiability threshold of random k-SAT formulae. The ideas which led to these bounds and the techniques used to obtain them, are explained. A companion paper in this volume present a survey of the lower bounds.