#2,579

Most Influential Person

American-Canadian computer scientist

According to Wikipedia, Stephen Arthur Cook, is an American-Canadian computer scientist and mathematician who has made major contributions to the fields of complexity theory and proof complexity. He is a university professor at the University of Toronto, Department of Computer Science and Department of Mathematics.

- The complexity of theorem-proving procedures (6624)
- The Relative Efficiency of Propositional Proof Systems (946)
- A Taxonomy of Problems with Fast Parallel Algorithms (690)
- Soundness and Completeness of an Axiom System for Program Verification (491)
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers (375)
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes (355)
- A new recursion-theoretic characterization of the polytime functions (331)
- ON THE MINIMUM COMPUTATION TIME OF FUNCTIONS (293)
- Time-bounded random access machines (254)
- Finding hard instances of the satisfiability problem: A survey (254)
- Feasibly constructive proofs and the propositional calculus (Preliminary Version) (222)
- Log Depth Circuits for Division and Related Problems (208)
- An observation on time-storage trade off (196)
- Problems Complete for Deterministic Logarithmic Space (163)
- Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines (154)
- Two Applications of Inductive Counting for Complementation Problems (152)
- The P versus NP Problem (149)
- Time Bounded Random Access Machines (145)
- Deterministic CFL's are accepted simultaneously in polynomial time and log squared space (137)
- A hierarchy for nondeterministic time complexity (136)
- Log Depth Circuits for Division and Related Problems (127)
- Space Lower Bounds for Maze Threadability on Restricted Machines (124)
- A time-space tradeoff for sorting on a general sequential model of computation (124)
- Functional interpretations of feasibly constructive arithmetic (122)
- An Observation on Time-Storage Trade Off (114)
- Logical Foundations of Proof Complexity: INDEX (109)
- Logical Foundations of Proof Complexity (107)
- Linear Time Simulation of Deterministic Two-Way Pushdown Automata (105)
- An Optimal Parallel Algorithm for Formula Evaluation (105)
- Storage Requirements for Deterministic Polynomial Time Recognizable Languages (102)
- Computing over the Reals: Foundations for Scientific Computing (99)
- The Relative Complexity of NP Search Problems (98)
- A New Characterization of Type-2 Feasibility (94)
- An Exponential Lower Bound for the Size of Monotone Real Circuits (90)
- A new recursion-theoretic characterization of the polytime functions (extended abstract) (89)
- Hardware complexity and parallel computation (89)
- An overview of computational complexity (88)
- A short proof of the pigeon hole principle using extended resolution (84)
- Short Propositional Formulas Represent Nondeterministic Computations (82)
- Bounds on the time for parallel RAM's to compute simple functions (80)
- The relative complexity of NP search problems (77)
- On the Number of Additions to Compute Specific Polynomials (74)
- Quantified propositional calculus and a second-order theory for NC1 (72)
- Consequences of the provability of NP ⊆ P/poly (69)
- Exponential Lower Bounds for Monotone Span Programs (69)
- Computability and Complexity of Higher Type Functions (66)
- A Hierarchy for Nondeterministic Time Complexity (66)
- Storage requirements for deterministic / polynomial time recognizable languages (66)
- Complexity Theory for Operators in Analysis (63)
- The proof complexity of linear algebra (61)
- The Classifikation of Problems which have Fast Parallel Algorithms (59)
- Characterizations of the basic feasible functionals of finite type (58)
- Functional Interpretations of Feasibly Constructive Arithmetic (58)
- A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation (54)
- Boolean programs and quantified propositional proof systems (52)
- The strength of replacement in weak arithmetic (51)
- The importance of the P versus NP question (46)
- The Parallel Complexity of Abelian Permutation Group Problems (41)
- Complexity Theory of Parallel Time and Hardware (39)
- The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy (39)
- Theories for complexity classes and their propositional translations (39)
- Path systems and language recognition (37)
- Two applications of complementation via inductive counting (35)
- A Depth-Universal Circuit (35)
- Proving assertions about programs that manipulate data structures (34)
- Computational complexity of higher type functions (29)
- An assertion language for data structures (28)
- The complexity of derivations of matrix identities (27)
- The parallel complexity of the abelian permutation group membership problem (25)
- Pebbles and Branching Programs for Tree Evaluation (23)
- The Hardness of Being Private (23)
- Corrections for "On the lengths of proofs in the propositional calculus preliminary version" (23)
- Cobham Alan. The intrinsic computational difficulty of functions. Logic, methodology and philosophy of science, Proceedings of the 1964 International Congress , edited by Bar-Hillel Yehoshua, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1965, pp. 2 (22)
- Complexity theory for operators in analysis (22)
- A second-order system for polytime reasoning based on Grädel's theorem (22)
- A Complete Axiomatization for Blocks World (20)
- The Recognition of Deterministic CFL's in Small Time and Space (19)
- Lower bounds in parallel machine computation (19)
- Efficiently Approximable Real-Valued Functions (18)
- Theories for TC0 and Other Small Complexity Classes (18)
- On the complexity of proof systems (18)
- A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula (17)
- A Tight Relationship Between Generic Oracles and Type-2 Complexity Theory (17)
- A new characterization of Mehlhorn's polynomial time functionals (17)
- Corrigendum: Soundness and Completeness of an Axiom System for Program Verification (15)
- The complexity of the comparator circuit value problem (14)
- Relating the provable collapse of P to NC1 and the power of logical theories (13)
- Average Case Lower Bounds for Monotone Switching Networks (13)
- A Feasibly Constructive Lower Bound for Resolution Proofs (12)
- Parallel Computation for Well-Endowed Rings (12)
- Formal Theories for Linear Algebra (11)
- The proof complexity of linear algebra (10)
- Parallel pointer machines (10)
- Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract) (9)
- The strength of replacement in weak arithmetic (9)
- Mathematical Foundations of Computer Science 2009 (8)
- Branching Programs for Tree Evaluation (8)
- A second-order theory for NL (7)
- Variations on pushdown machines (Detailed Abstract) (7)
- A second-order system for polytime reasoning using Gradel's theorem (7)
- The Solvability of the Derivability Problem for One-Normal Systems (7)
- Erratum: Two Applications of Inductive Counting for Complementation Problems (7)
- Formalizing Randomized Matching Algorithms (6)
- Logical Foundations of Proof Complexity: INTRODUCTION (6)
- Average case computational complexity theory (6)
- VTC: A Second-Order Theory for TC (6)
- The Complexity of Proving the Discrete Jordan Curve Theorem (5)
- A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem (5)
- Fractional Pebbling and Thrifty Branching Programs (5)
- The Hardness of Being Private (5)
- Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs (5)
- Relativizing small complexity classes and their theories (4)
- Uniform, integral and efficient proofs for the determinant identities (4)
- Relativizing Small Complexity Classes and Their Theories (4)
- A second-order theory for NL (4)
- Eeciently Approximable Real-valued Functions (3)
- The optimal placement of replicas in a network using a read any - write all policy (3)
- Review: Alan Cobham, Yehoshua Bar-Hillel, The Intrinsic Computational Difficulty of Functions (3)
- Computational complexity of higher type functions : plenary address, International Congress of Mathematicians Kyoto, Japan August, 1990 (3)
- On the number of additions to compute specific polynomials (Preliminary Version) (3)
- Logical Foundations of Proof Complexity: PEANO ARITHMETIC AND ITS SUBSYSTEMS (3)
- The Log Space Oracle Hierarchy Collapses DRAFT (2)
- Formal Theories for Linear Algebra (2)
- A second-order system for polynomial-time reasoning based on Graedel's theorem (2)
- VTC circ: A Second-Order Theory for TCcirc (2)
- Theories for Subexponential-size Bounded-depth Frege Proofs (2)
- Review: Manuel Blum, A Machine-Independent Theory of the Complexity of Recursive Functions (2)
- Complexity Classes and Theories for the Comparator Circuit Value Problem (1)
- The Complexity of Proving the Discrete Jordan Curve Theorem (1)
- Hardware Complexity and Parallel Computation (Preliminary Version) (1)
- An overview of computational complexity (1)
- Relativized Propositional Calculus (1)
- Comments on Beckmann's Uniform Reducts (0)
- Functional Interpretations of Feasibly Constructive Arithmetic Abstract (0)
- The Achievements and Challenges of Computational Complexity (0)
- VTC/sup O/: a second-order theory for TC/sup 0/ (0)
- And Other Small Complexity Classes (0)
- Advances in Complexity Theory (0)
- Uniform, Integral, and Feasible Proofs for the Determinant Identities (0)
- The Complexity of Theorem-Proving Procedures (1971) (0)
- A Survey of Classes of Primitive Recursive Functions (0)
- The Tree Evaluation Problem : Towards Separating P from NL Lecture # 6 : 26 February 2014 (0)
- Complexity Classes, Propositional Proof Systems, and Formal Theories (0)
- Logical Foundations of Proof Complexity: TWO-SORTED LOGIC AND COMPLEXITY CLASSES (0)
- THEORIES FOR POLYNOMIAL TIME AND BEYOND (0)
- Review: Jan Krajicek, Pavel Pudlak, Gaisi Takeuti, Bounded Arithmetic and the Polynomial Hierarchy; Samuel R. Buss, Relating the Bounded Arithmetic and Polynomial Time Hierarchies; Domenico Zambella, Notes on Polynomially Bounded Arithmetic (0)
- Mathematisches Forschungsinstitut Oberwolfach Proving Hard-core Predicates Using List Decoding Proving Integrality Gaps without Knowing the Linear Program How to Go beyond the Black-box Simulation Barrier Derandomization in Cryptography Formula Caching Proof Systems Algebras of Minimal Rank over Arb (0)
- Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk) (0)
- Logical Foundations of Proof Complexity: THE THEORY V 1 AND POLYNOMIAL TIME (0)
- THE PREDICATE CALCULUS AND THE SYSTEM LK (0)
- The Turing Computational Model (0)
- Recent Advances in Complexity Theory (0)
- A Complete Axiomatization for Blo ks World (0)
- The Strength of Replacement in Weak Arithmetic (0)
- Computational Complexity ( 10 w 5028 ) (0)
- Logical Foundations of Proof Complexity: THE THEORY V 0 AND AC 0 (0)
- Review: Jiri Becvar, Real-Time and Complexity Problems in Automata Theory (0)
- Explorer Fractional Pebbling and Thrifty Branching Programs (0)
- THEORIES FOR SMALL CLASSES (0)
- Formalizing Randomized Matching Algorithms (0)
- Leibniz International Proceedings in Informatics Fractional Pebbling and Thrifty Branching Programs (0)
- Bečvář Jiří. Real-time and complexity problems in automata theory. English with Czech summary. Kybernetika (Prague), vol. 1 (1965), pp. 475–498. (0)
- Blum Manuel. A Machine-independent theory of the complexity of recursive functions. Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 322–336. (0)
- Logical Foundations of Proof Complexity: PROOF SYSTEMS AND THE REFLECTION PRINCIPLE (0)
- Logical Foundations of Computer Science (0)

This paper list is powered by the following services:

Stephen Cook is affiliated with the following schools:

This website uses cookies to enhance the user experience. Privacy Policy

Want to be an Academic Influence Insider?

Sign up to get the latest news, information, and rankings in our upcoming newsletter.