The complexity of theorem-proving procedures SA Cook Proceedings of the third annual ACM symposium on Theory of computing, 151-158, 1971 | 9532 | 1971 |

The relative efficiency of propositional proof systems SA Cook, RA Reckhow The journal of symbolic logic 44 (1), 36-50, 1979 | 1105 | 1979 |

A taxonomy of problems with fast parallel algorithms SA Cook Information and control 64 (1-3), 2-22, 1985 | 852 | 1985 |

A new recursion-theoretic characterization of the polytime functions S Bellantoni, S Cook Computational complexity 2 (2), 97-110, 1992 | 632 | 1992 |

Soundness and completeness of an axiom system for program verification SA Cook SIAM Journal on Computing 7 (1), 70-90, 1978 | 617 | 1978 |

Time bounded random access machines SA Cook, RA Reckhow Journal of Computer and System Sciences 7 (4), 354-375, 1973 | 498 | 1973 |

Characterizations of pushdown machines in terms of time-bounded computers SA Cook Journal of the ACM (JACM) 18 (1), 4-18, 1971 | 445 | 1971 |

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 | 422 | 1986 |

On the minimum computation time of functions SA Cook, SO Aanderaa Transactions of the American Mathematical Society 142, 291-314, 1969 | 410 | 1969 |

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 | 374 | 1987 |

Log depth circuits for division and related problems PW Beame, SA Cook, HJ Hoover SIAM Journal on Computing 15 (4), 994-1003, 1986 | 356 | 1986 |

Finding hard instances of the satisfiability problem: A survey. SA Cook, DG Mitchell Satisfiability Problem: Theory and Applications 35, 1-17, 1996 | 338 | 1996 |

The P versus NP problem S Cook The millennium prize problems, 87-104, 2006 | 331 | 2006 |

An observation on time-storage trade off SA Cook Proceedings of the fifth annual ACM symposium on Theory of computing, 29-33, 1973 | 324 | 1973 |

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 | 301 | 1975 |

An overview of computational complexity SA Cook ACM Turing award lectures, 1982, 2007 | 289 | 2007 |

A hierarchy for nondeterministic time complexity SA Cook Proceedings of the fourth annual ACM symposium on Theory of computing, 187-192, 1972 | 248 | 1972 |

Logical foundations of proof complexity S Cook, P Nguyen Cambridge University Press, 2010 | 246* | 2010 |

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 | 232 | 2002 |

Functional interpretations of feasibly constructive arithmetic S Cook, A Urquhart Annals of pure and applied logic 63 (2), 103-200, 1993 | 210 | 1993 |