On the satisfiability threshold of formulas with three literals per clause

Hard and easy distributions of SAT problems

David G. M. Mitchell, Bart Selman, Hector J. Levesque · National Conference on Artificial Intelligence · 1992 · 807 citations

Computing, Computer Science, Algorithms +8

Sharp thresholds of graph properties, and the $k$-sat problem

Ehud Friedgut, appendix by Jean Bourgain · Journal of the American Mathematical Society · 1999 · 692 citations · Full text

Natural Sciences, Computer Science, Mathematics +9

Critical Behavior in the Satisfiability of Random Boolean Expressions

Scott Kirkpatrick, Bart Selman · Science · 1994 · 598 citations

Computing, Computer Science, Mathematics +13

Random<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>K</mml:mi></mml:math>-satisfiability problem: From an analytic solution to an efficient algorithm

Marc Mézard, Riccardo Zecchina · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · 2002 · 445 citations · Full text

Computing, Computer Science, Algorithms +12

Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem

John Franco, Marvin C. Paull · Discrete Applied Mathematics · 1983 · 231 citations

Computing, Computer Science, Mathematics +12