- The complexity of theorem-proving procedures
1971/01/01 by Stephen Cook · 118 citations
Computer Science · Mathematics · #Algorithm #Bounded function #Computability, Logic, AI Algorithms #Computation #Computer science #Conjunctive normal form #Constraint satisfaction problem #Decision problem #Discrete mathematics #Machine Learning and Algorithms #Mathematics #NP #Nondeterministic algorithm #Oracle #Predicate (mathematical logic) #Propositional calculus #Time complexity #Time hierarchy theorem #Turing machine #Universal Turing machine #semigroups and automata theory