Hard and easy distributions of SAT problems

Computers and Intractability: A Guide to the Theory of NP-Completeness

1979 • 45,565 citations

The complexity of theorem-proving procedures

1971 • 6,155 citations

A Computing Procedure for Quantification Theory

1960 • 2,592 citations

A new method for solving hard satisfiability problems

1992 • 1,203 citations

Where the really hard problems are

1991 • 1,079 citations

The intractability of resolution

1985 • 845 citations

Many hard examples for resolution

1988 • 456 citations

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

1983 • 235 citations

Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem

1990 • 204 citations

A rearrangement search strategy for determining propositional satisfiability

1988 • 110 citations

Algorithms for testing the satisfiability of propositional formulae

1989 • 96 citations

On the complexity of regular resolution and the Davis-Putnam procedure

1977 • 90 citations

Resolution vs. cutting plane solution of inference problems: Some computational experience

1988 • 80 citations

Probabilistic performance of a heuristic for the satisfiability problem

1988 • 23 citations

The complexity of automated reasoning

1990 • 16 citations