Stephen Cook
Stephen Cook
Department of Computer Science, University of Toronto
Підтверджена електронна адреса в cs.toronto.edu
НазваПосиланняРік
The complexity of theorem-proving procedures
SA Cook
Proceedings of the third annual ACM symposium on Theory of computing, 151-158, 1971
79811971
The relative efficiency of propositional proof systems
SA Cook, RA Reckhow
The Journal of Symbolic Logic 44 (1), 36-50, 1979
9391979
A taxonomy of problems with fast parallel algorithms
SA Cook
Information and control 64 (1-3), 2-22, 1985
7801985
A new recursion-theoretic characterization of the polytime functions
S Bellantoni, S Cook
Computational complexity 2 (2), 97-110, 1992
5791992
Soundness and completeness of an axiom system for program verification
SA Cook
SIAM Journal on Computing 7 (1), 70-90, 1978
5541978
Time bounded random access machines
SA Cook, RA Reckhow
Journal of Computer and System Sciences 7 (4), 354-375, 1973
4351973
Characterizations of pushdown machines in terms of time-bounded computers
SA Cook
Journal of the ACM (JACM) 18 (1), 4-18, 1971
4211971
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
3761986
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, 1987
3391987
Log depth circuits for division and related problems
PW Beame, SA Cook, HJ Hoover
SIAM Journal on Computing 15 (4), 994-1003, 1986
3371986
On the minimum computation time of functions
SA Cook, SO Aanderaa
Transactions of the American Mathematical Society 142, 291-314, 1969
3191969
Finding hard instances of the satisfiability problem
SA Cook, DG Mitchell
Satisfiability problem: theory and applications: DIMACS workshop 35, 1-17, 1997
3041997
An observation on time-storage trade off
SA Cook
Proceedings of the fifth annual ACM symposium on Theory of computing, 29-33, 1973
3011973
The P versus NP problem
S Cook
The millennium prize problems, 87-104, 2006
2582006
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
2521975
An overview of computational complexity
SA Cook
Communications of the ACM 26 (6), 400-408, 1983
2361983
A hierarchy for nondeterministic time complexity
SA Cook
Journal of Computer and System Sciences 7 (4), 343-353, 1973
2141973
Roles of nonstructural protein nsP2 and alpha/beta interferons in determining the outcome of Sindbis virus infection
EI Frolova, RZ Fayzulin, SH Cook, DE Griffin, CM Rice, I Frolov
Journal of virology 76 (22), 11254-11264, 2002
1982002
Functional interpretations of feasibly constructive arithmetic
S Cook, A Urquhart
Annals of Pure and Applied Logic 63 (2), 103-200, 1993
1921993
Towards a complexity theory of synchronous parallel computation
SA Cook
L Enseignement mathmatique, 99-124, 1981
1871981
У даний момент система не може виконати операцію. Спробуйте пізніше.
Статті 1–20