Satisfiability threshold for random XOR-CNF formulas

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

Computing, Computer Science, Mathematics +17

The complexity of satisfiability problems

Thomas J. Schaefer · 1978 · 1.8K citations · Full text

Computing, Computer Science, Algorithms +12

A linear-time algorithm for testing the truth of certain quantified boolean formulas

Bengt Aspvall, Michael F. Plass, Robert E. Tarjan · Information Processing Letters · 1979 · 901 citations

Computing, Computer Science, Mathematics +14

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

Analysis of Two Simple Heuristics on a Random Instance ofk-sat

Alan Frieze, Stephen Suen · Journal of Algorithms · 1996 · 227 citations

Computing, Computer Science, Mathematics +13