The complexity of theorem-proving procedures

  title={The complexity of theorem-proving procedures},
  author={S. Cook},
  journal={Proceedings of the third annual ACM symposium on Theory of computing},
  • S. Cook
  • Published 1971
  • Computer Science, Mathematics
  • Proceedings of the third annual ACM symposium on Theory of computing
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced” means, roughly speaking, that the first problem can be solved deterministically in polynomial time provided an oracle is available for solving the second. From this notion of reducible, polynomial degrees of difficulty are defined, and it is shown that the problem of… Expand
Complete problems for deterministic polynomial time
Complete Problems for Deterministic Polynomial Time
P = NP
Complexity of solvable cases of the decision problem for the predicate calculus
  • H. R. Lewis
  • Mathematics, Computer Science
  • 19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
  • 1978
The complexity of satisfiability problems
A Solution of the P versus NP Problem
New problems complete for nondeterministic log space
Complete Problems in the First-Order Predicate Calculus
  • D. Plaisted
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1984
The Relative Efficiency of Propositional Proof Systems


Bennett: On Spectra
  • Doctoral Dissertation, Princeton University,
  • 1962