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.

Pavel Pudlák

doi:10.1017/bsl.2023.38

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

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.

Volume 29, Issue 4
Pavel Pudlák ^(a1)
DOI: https://doi.org/10.1017/bsl.2023.38

Your Kindle email address

@free.kindle.com @kindle.com (service fees apply)

Available formats PDF

By using this service, you agree that you will only keep content for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

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.

Volume 29, Issue 4
Pavel Pudlák ^(a1)
DOI: https://doi.org/10.1017/bsl.2023.38

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

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.

Volume 29, Issue 4
Pavel Pudlák ^(a1)
DOI: https://doi.org/10.1017/bsl.2023.38

Reply to: Submit a response

Title * Please enter a title for your response.

Contents * Please enter your response.

Your details

First name * Please enter your first name.

Last name * Please enter your last name.

Please enter a valid email address.

Occupation Please enter your occupation.

Affiliation Please enter any affiliation.

You have entered the maximum number of contributors

Conflicting interests

Do you have any conflicting interests? * Conflicting interests help

Yes No

More information * Please enter details of the conflict of interest or select 'No'.

Please tick the box to confirm you agree to our Terms of use. *

Please accept terms of use.

Please tick the box to confirm you agree that your name, comment and conflicts of interest (if accepted) will be visible on the website and your comment may be printed in the journal at the Editor’s discretion. *

Please confirm you agree that your details will be displayed.

Article contents

Review products

Abstract

Access options

References