Theoretical Computer Science · 1987 · 71 citations · 14 references
ComputingComputer ScienceMathematicsAlgorithmsSet TheoryTheory Of ComputationChurch-turing ThesisComputational ComplexityComputational Complexity ClassesModel TheoryStructural ComplexityTime ComplexityCompletenessCompleteness ResultsNp-complete Problems
14
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
Theory of Recursive Functions and Effective Computability
D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text