Stephen Cook
University of Toronto
H-index: 52
North America-Canada
Top articles of Stephen Cook
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
The 1982 ACM Turing Award Lecture: An Overview of Computational Complexity | Stephen A Cook | 2023/5/23 | |
The relative efficiency of propositional proof systems | Stephen A Cook Robert A Reckhow | 2023/5/23 | |
A survey of classes of primitive recursive functions | Stephen A Cook | 2023/5/23 | |
The complexity of theorem-proving procedures | Stephen A Cook | 2023/5/23 | |
A time-space tradeoff for sorting on a general sequential model of computation | Allan Borodin Stephen Cook | 2023/5/23 | |
Towards a complexity theory of synchronous parallel computation | Stephen A Cook | 2023/5/23 | |
Feasibly constructive proofs and the propositional calculus (preliminary version) | Stephen A Cook | 2023/5/23 | |
Characterizations of pushdown machines in terms of time-bounded computers | Stephen A Cook | 2023/5/23 | |
CS 4995 Notes Fall, 2022 | Notes | S Cook T Pitassi | 2022 |
The complexity of theorem-proving procedures (1971) | Stephen A Cook | 2021/2/2 | |
Uniform, integral, and feasible proofs for the determinant identities | Journal of the ACM (JACM) | Iddo Tzameret Stephen A Cook | 2021/1/13 |
