Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook - researchr publication

researchr

You are not signed in
Sign in
Sign up

Bruce M. Kapron, editor, Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook. Volume 43 of ACM Books, ACM, 2023. [doi]

Abstract is missing.

IntroductionBruce M. Kapron. [doi]

Stephen Cook: Complexity's Humble HeroMichelle Waitzman. 3-28 [doi]

ACM Interview of Stephen A. Cook by Bruce M. Kapron29-44 [doi]

The 1982 ACM Turing Award Lecture: An Overview of Computational ComplexityStephen A. Cook. 47-70 [doi]

Cook's NP-completeness Paper and the Dawn of the New TheoryChristos H. Papadimitriou. 73-82 [doi]

The Cook-Reckhow DefinitionJan Krajícek. 83-94 [doi]

Polynomially Verifiable ArithmeticSam Buss. 95-106 [doi]

Towards a Complexity Theory of Parallel ComputationPaul Beame, Pierre McKenzie. 107-126 [doi]

Computation with Limited SpaceNicholas Pippenger. 127-140 [doi]

The Complexity of Theorem-Proving ProceduresStephen A. Cook. 143-152 [doi]

Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersStephen A. Cook. 153-172 [doi]

The Relative Efficiency of Propositional Proof SystemsStephen A. Cook, Robert A. Reckhow. 173-192 [doi]

Feasibly Constructive Proofs and the Propositional Calculus (Preliminary Version)Stephen A. Cook. 193-218 [doi]

Towards a Complexity Theory of Synchronous Parallel ComputationStephen A. Cook. 219-244 [doi]

A Time-Space Tradeoff for Sorting on a General Sequential Model of ComputationAllan Borodin, Stephen A. Cook. 245-260 [doi]

Pebbles and Branching Programs for Tree EvaluationStephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam. 261-318 [doi]

Cook's Berkeley NotesBruce M. Kapron. 321-324 [doi]

A Survey of Classes of Primitive Recursive FunctionsStephen A. Cook. 325-336 [doi]

Further Reading337-338 [doi]

Bibliography339-382 [doi]

Contributors' Biographies/Index383-398 [doi]

runs on WebDSL