Obserwuj
Stephen Cook
Stephen Cook
Department of Computer Science, University of Toronto
Zweryfikowany adres z cs.toronto.edu
Tytuł
Cytowane przez
Cytowane przez
Rok
The complexity of theorem-proving procedures
SA Cook
Proceedings of the third annual ACM symposium on Theory of computing, 151-158, 1971
100581971
The relative efficiency of propositional proof systems
SA Cook, RA Reckhow
The journal of symbolic logic 44 (1), 36-50, 1979
11721979
A taxonomy of problems with fast parallel algorithms
SA Cook
Information and control 64 (1-3), 2-22, 1985
8751985
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
6301992
Soundness and completeness of an axiom system for program verification
SA Cook
SIAM Journal on Computing 7 (1), 70-90, 1978
6301978
Time-bounded random access machines
SA Cook, RA Reckhow
Proceedings of the fourth annual ACM symposium on Theory of computing, 73-80, 1972
5171972
Characterizations of pushdown machines in terms of time-bounded computers
SA Cook
Journal of the ACM (JACM) 18 (1), 4-18, 1971
4551971
On the minimum computation time of functions
SA Cook, SO Aanderaa
Transactions of the American Mathematical Society 142, 291-314, 1969
4401969
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
4291986
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
3781987
The P versus NP problem
S Cook
Clay Mathematics Institute 2, 2000
3742000
Log depth circuits for division and related problems
PW Beame, SA Cook, HJ Hoover
SIAM Journal on Computing 15 (4), 994-1003, 1986
3711986
Finding hard instances of the satisfiability problem: A survey
SA Cook, DG Mitchell
Satisfiability Problem: Theory and Applications 35, 1-17, 1997
3521997
An observation on time-storage trade off
SA Cook
Proceedings of the fifth annual ACM symposium on Theory of computing, 29-33, 1973
3321973
Feasibly constructive proofs and the propositional calculus (preliminary version)
SA Cook
Proceedings of the seventh annual ACM symposium on Theory of computing, 83-97, 1975
3061975
An overview of computational complexity
SA Cook
Communications of the ACM 26 (6), 400-408, 1983
2931983
Logical foundations of proof complexity
S Cook, P Nguyen
Cambridge University Press, 2010
256*2010
A hierarchy for nondeterministic time complexity
SA Cook
Proceedings of the fourth annual ACM symposium on Theory of computing, 187-192, 1972
2521972
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
2221974
Functional interpretations of feasibly constructive arithmetic
S Cook, A Urquhart
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
2131989
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20