Follow
Stephen Cook
Stephen Cook
Department of Computer Science, University of Toronto
Verified email at cs.toronto.edu
Title
Cited by
Cited by
Year
The complexity of theorem-proving procedures
SA Cook
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …, 2023
109092023
The relative efficiency of propositional proof systems
SA Cook, RA Reckhow
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …, 2023
12382023
A taxonomy of problems with fast parallel algorithms
SA Cook
Information and control 64 (1-3), 2-22, 1985
9091985
Soundness and completeness of an axiom system for program verification
SA Cook
SIAM Journal on Computing 7 (1), 70-90, 1978
6691978
A new recursion-theoretic characterization of the polytime functions
S Bellantoni, S Cook
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992
6621992
Time-bounded random access machines
SA Cook, RA Reckhow
Proceedings of the fourth annual ACM symposium on Theory of computing, 73-80, 1972
5551972
On the minimum computation time of functions
SA Cook, SO Aanderaa
Transactions of the American Mathematical Society 142, 291-314, 1969
4991969
Characterizations of pushdown machines in terms of time-bounded computers
SA Cook
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …, 2023
4652023
The P versus NP problem
S Cook
Clay Mathematics Institute 2, 6, 2000
4442000
Upper and lower time bounds for parallel random access machines without simultaneous writes
S Cook, C Dwork, R Reischuk
SIAM Journal on Computing 15 (1), 87-97, 1986
4321986
Log depth circuits for division and related problems
PW Beame, SA Cook, HJ Hoover
SIAM Journal on Computing 15 (4), 994-1003, 1986
4061986
Contributions of hydrogen bonds of Thr 157 to the thermodynamic stability of phage T4 lysozyme
T Alber, S Dao-Pin, K Wilson, JA Wozniak, SP Cook, BW Matthews
Nature 330 (6143), 41-46, 1987
3801987
Finding hard instances of the satisfiability problem: A survey.
SA Cook, DG Mitchell
Satisfiability Problem: Theory and Applications 35, 1-17, 1996
3691996
An observation on time-storage trade off
SA Cook
Proceedings of the fifth annual ACM symposium on Theory of computing, 29-33, 1973
3421973
An overview of computational complexity
SA Cook
ACM Turing award lectures, 1982, 2007
3262007
Feasibly constructive proofs and the propositional calculus (preliminary version)
SA Cook
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …, 2023
3152023
A hierarchy for nondeterministic time complexity
SA Cook
Proceedings of the fourth annual ACM symposium on Theory of computing, 187-192, 1972
2781972
Logical foundations of proof complexity
S Cook, P Nguyen
Cambridge University Press, 2010
2732010
On the lengths of proofs in the propositional calculus (preliminary version)
S Cook, R Reckhow
Proceedings of the sixth annual ACM symposium on Theory of computing, 135-148, 1974
2301974
Functional interpretations of feasibly constructive arithmetic
S Cook, A Urquhart
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
2261989
The system can't perform the operation now. Try again later.
Articles 1–20