The complexity of theorem-proving procedures SA Cook Logic, automata, and computational complexity: The works of Stephen A. Cook …, 2023 | 11027 | 2023 |

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

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

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

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 | 669 | 1992 |

Time-bounded random access machines SA Cook, RA Reckhow Proceedings of the fourth annual ACM symposium on Theory of computing, 73-80, 1972 | 559 | 1972 |

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

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

The P versus NP problem S Cook Clay Mathematics Institute 2 (6), 3, 2000 | 450 | 2000 |

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

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

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

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

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

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

Feasibly constructive proofs and the propositional calculus (preliminary version) SA Cook Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …, 2023 | 326 | 2023 |

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

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

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 | 231 | 1974 |

Functional interpretations of feasibly constructive arithmetic S Cook, A Urquhart Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989 | 227 | 1989 |