A comparison of polynomial time reducibilities

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

Computing, Computer Science, Mathematics +17

Theory of Recursive Functions and Effective Computability.

Solomon Feferman, Hartley Rogers · American Mathematical Monthly · 1969 · 2.8K citations

Computing, Computer Science, Mathematics +14

Theory of Recursive Functions and Effective Computability

D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text

Computing, Computer Science, Mathematics +14

Formal Languages and their Relation to Automata

James B. Morris · Nuclear Science and Engineering · 1970 · 1K citations

Computing, Computer Engineering, Computer Science +12

Recursively enumerable sets of positive integers and their decision problems

Emil L. Post · Bulletin of the American Mathematical Society · 1944 · 890 citations · Full text

Humanities, Computer Science, Mathematics +13