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]
No reviews for this publication, yet.