Recognizing disguised NR(1) instances of the satisfiability problem

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

Combinatorial Algorithms: Theory and Practice.

Tony Greenfield, Edward M. Reingold, Jurg Nievergeld et al. · Journal of the Royal Statistical Society Series D (The Statistician) · 1978 · 428 citations

Natural Sciences, Computer Science, Mathematics +12

Proceedings of the third annual ACM symposium on Theory of computing

Michael A. Harrison, Ranan B. Banerji, Jeffrey D. Ullman · 1971 · 206 citations

Computing, Computer Science, Algorithms +11