Get started
Keyword

satisfiability threshold

Description: The critical constraint density at which random instances of a satisfiability problem transition from typically satisfiable to typically unsatisfiable.
OpenAlex ID: keywords/satisfiability-threshold
Analytic and Algorithmic Solution of Random Satisfiability Problems
2002 · M. Mézard, G. Parisi, et al. · Science · 1,071
Survey propagation: An algorithm for satisfiability
2005 · A. Braunstein, M. Mézard, et al. · Random Structures and Algorithms · 433
PDF
Survey propagation: An algorithm for satisfiability
2005 · BraunsteinA., MézardM., et al. · Random Structures and Algorithms · 245
A Threshold for Unsatisfiability
1996 · Andreas Goerdt · Journal of Computer and System Sciences · 241
PDF
Mick Gets Some (the Odds Are on His Side)
1992 · Vašek Chvátal, Bruce A. Reed · OpenGrey (Institut de l'Information Scientifique et Technique) · 238
Analysis of Two Simple Heuristics on a Random Instance ofk-sat
1996 · Alan Frieze, Stephen Suen · Journal of Algorithms · 220
Replica Bounds for Optimization Problems and Diluted Spin Systems
2003 · Silvio Franz, Michele Leone · Journal of Statistical Physics · 218
PDF
Finding hard instances of the satisfiability problem: A survey
1997 · Stephen Cook, David Mitchell · DIMACS series in discrete mathematics and theoretical computer science · 216
Mick gets some (the odds are on his side) (satisfiability)
1992 · V. Chvatal, B. Reed · Annual Symposium on Foundations of Computer Science · 215
Statistical mechanics of the random K -satisfiability model
1997 · Rémi Monasson, Riccardo Zecchina · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · 208
PDF
Typical random 3-SAT formulae and the satisfiability threshold
2002 · Dubois, Olivier, Boufkhad, Yacine, et al. · arXiv (Cornell University) · 191
PDF
Lower bounds for random 3-SAT via differential equations
2001 · Dimitris Achlioptas · Theoretical Computer Science · 190
PDF
Entropy of theK-Satisfiability Problem
1996 · Rémi Monasson, Riccardo Zecchina · Physical Review Letters · 190
PDF
Threshold values of random K‐SAT from the cavity method
2005 · Stephan Mertens, Marc Mézard, et al. · Random Structures and Algorithms · 188
PDF
The threshold for random k-SAT is 2 k (ln 2 - O(k))
2003 · Dimitris Achlioptas, Yuval Peres · ACM Symposium on Theory of Computing (STOC) · 178
The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
2004 · Dimitris Achlioptas, Yuval Peres · Journal of the American Mathematical Society · 174
PDF
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
2009 · Parikshit Gopalan, Phokion G. Kolaitis, et al. · SIAM Journal on Computing · 163
Random Constraint Satisfaction: Flaws and Structure
2001 · Ian P. Gent, Ewan Macintyre, et al. · Constraints · 156
On the solution-space geometry of random constraint satisfaction problems
2006 · Dimitris Achlioptas, Federico Ricci-Tersenghi · ACM Symposium on Theory of Computing (STOC) · 152
A new look at survey propagation and its generalizations
2007 · Elitza Maneva, Elchanan Mossel, et al. · Journal of the ACM · 135
A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
1997 · O Dubois, Y Boufkhad · Journal of Algorithms · 135
The SAT phase transition
1994 · Ian P. Gent, Toby Walsh · 119
The asymptotic order of the random k-SAT threshold
2003 · D. Achlioptas, C. Moore · 118
Random constraint satisfaction: A more accurate picture
1997 · Dimitris Achlioptas, Lefteris M. Kirousis, et al. · Lecture notes in computer science · 113
Tail bounds for occupancy and the satisfiability threshold conjecture
1995 · Anil Kamath, Rajeev Motwani, et al. · Random Structures and Algorithms · 112
Works count: 510
Citation count: 10,600
Year
Topic
Type