# The complexity of theorem-proving procedures

@article{Cook1971TheCO, title={The complexity of theorem-proving procedures}, author={S. Cook}, journal={Proceedings of the third annual ACM symposium on Theory of computing}, year={1971} }

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

#### Topics from this paper

#### 6,355 Citations

Complete Problems for Deterministic Polynomial Time

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1976

Complexity of solvable cases of the decision problem for the predicate calculus

- Mathematics, Computer Science
- 19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
- 1978

The complexity of satisfiability problems

- Computer Science, Mathematics
- STOC
- 1978

New problems complete for nondeterministic log space

- Mathematics, Computer Science
- Mathematical systems theory
- 2005

Complete Problems in the First-Order Predicate Calculus

- Computer Science, Mathematics
- J. Comput. Syst. Sci.
- 1984

#### References

Bennett: On Spectra

- Doctoral Dissertation, Princeton University,
- 1962