No CrossRef data available.
Article contents
Logic, Automata, and Computational Complexity: The Works Of Stephen A. Cook. Edited by Bruce M. Kapron, ACM Books, vol. 43. Association for Computing Machinery, New York, xxvi + 398 pp.—therein: - Michelle Waitzman. Stephen Cook: Complexity’s Humble Hero, pp. 3–28. - Bruce M. Kapron and Stephen A. Cook, ACM Interview of Stephen A. Cook by Bruce M. Kapron, pp. 29–44. - Stephen A. Cook, Overview of Computational Complexity, pp. 47–70. - Christos H. Papadimitriou, Cook’s NP-Completeness Paper and the Dawn of the New Theory, pp. 73–82. - Jan Krajíček, The Cook–Reckhow Definition, pp. 83–94. - Sam Buss, Polynomially Verifiable Arithmetic, pp. 95–106. - Paul Beame and Pierre McKenzie, Towards a Complexity Theory of Parallel Computation, pp. 107–126. - Nicholas Pippenger, Computation with Limited Space, pp. 127–140. - Stephen A. Cook, The Complexity of Theorem-Proving Procedures, pp. 143–152. - Stephen A. Cook, Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, pp. 153–172. - Stephen A. Cook and Robert A. Reckhow, The Relative Efficiency of Propositional Proof Systems, pp. 173–192. - Stephen A. Cook, Feasibly Constructive Proofs and the Propositional Calculus (Preliminary Version), pp. 193–218. - Stephen A. Cook, Towards a Complexity Theory of Synchronous Parallel Computation, pp. 219–244. - Allan Borodin and Stephen A. Cook, A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation, pp. 245–260. - Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, and Rahul Santhanam, Pebbles and Branching Programs for Tree Evaluation, pp. 261–318. - Bruce M. Kapron, Cook’s Berkeley Notes, pp. 321–324. - Stephen A. Cook, A Survey of Classes of Primitive Recursive Functions, pp. 325–336.
Review products
Logic, Automata, and Computational Complexity: The Works Of Stephen A. Cook. Edited by Bruce M. Kapron, ACM Books, vol. 43. Association for Computing Machinery, New York, xxvi + 398 pp.—therein:
Michelle Waitzman. Stephen Cook: Complexity’s Humble Hero, pp. 3–28.
Bruce M. Kapron and Stephen A. Cook, ACM Interview of Stephen A. Cook by Bruce M. Kapron, pp. 29–44.
Published online by Cambridge University Press: 23 February 2024
Abstract
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Review
- Information
- Copyright
- © The Author(s), 2024. Published by Cambridge University Press on behalf of The Association for Symbolic Logic
References
1 Cook was awarded the prize in 1982, the interview is from 2016.