The complexity of theorem-proving procedures
The complexity of theorem-proving procedures is one of 9,000 studies in the ScholarPulse dataset. Key details — Authors: Stephen Cook; Year: 1971; Field: Computability, Logic, AI Algorithms.
| Authors | Stephen Cook |
|---|---|
| Year | 1971 |
| Field | Computability, Logic, AI Algorithms |
| Times cited | 6177 |
| Type | article |
| DOI / link | https://doi.org/10.1145/800157.805047 |