"The Complexity of Theorem-Proving Procedures."

Stephen A. Cook (2023)

> Home

Details and statistics

DOI: 10.1145/3588287.3588297

access: closed

type: Part in Book or Collection

metadata version: 2023-09-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - books/acm/23/Cook23a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/acm/23/Cook23a
Stephen A. Cook:
The Complexity of Theorem-Proving Procedures. Logic, Automata, and Computational Complexity 2023: 143-152

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.