Stephen A. Cook. The Complexity of Theorem-Proving Procedures. In Bruce M. Kapron, editor, Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook. Volume 43 of ACM Books, pages 143-152, ACM, 2023. [doi]
@incollection{Cook23a,
title = {The Complexity of Theorem-Proving Procedures},
author = {Stephen A. Cook},
year = {2023},
doi = {10.1145/3588287.3588297},
url = {https://doi.org/10.1145/3588287.3588297},
researchr = {https://researchr.org/publication/Cook23a},
cites = {0},
citedby = {0},
pages = {143-152},
booktitle = {Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook},
editor = {Bruce M. Kapron},
volume = {43},
series = {ACM Books},
publisher = {ACM},
isbn = {979-8-4007-0780-3},
}