Stephen Arthur Cook, Ph.D.
Affiliations: | Computer Science | University of Toronto, Toronto, ON, Canada |
Area:
complexity theory, proof complexity, P vs NPGoogle:
"Stephen Cook"Children
Sign in to add trainee| Mark Braverman | grad student | ||
| Walter John Savitch | grad student | University of Toronto | |
| Roberto Lins de Carvalho | grad student | 1974 | University of Toronto |
| Francois Pitt | grad student | 2000 | University of Toronto |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Cook SA, Filmus Y, Lê DTM. (2014) The complexity of the comparator circuit value problem Acm Transactions On Computation Theory. 6 |
| Cook S, Fontes L. (2012) Formal theories for linear algebra Logical Methods in Computer Science. 8 |
| Kawamura A, Cook S. (2012) Complexity theory for operators in analysis Acm Transactions On Computation Theory. 4 |
| Cook S, McKenzie P, Wehr D, et al. (2012) Pebbles and branching programs for tree evaluation Acm Transactions On Computation Theory. 3 |
| Nguyen P, Cook S. (2012) The complexity of proving the discrete jordan curve theorem Acm Transactions On Computational Logic. 13 |
| Braverman M, Cook S, McKenzie P, et al. (2009) Fractional pebbling and thrifty branching programs Leibniz International Proceedings in Informatics, Lipics. 4: 109-120 |
| Braverman M, Cook S, McKenzie P, et al. (2009) Branching programs for tree evaluation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5734: 175-186 |
| Nguyen P, Cook SA. (2006) Theories for TC0 and Other Small Complexity Classes Logical Methods in Computer Science. 2 |
| Cook S, Thapen N. (2006) The strength of replacement in weak arithmetic Acm Transactions On Computational Logic. 7: 749-764 |
| Braverman M, Cook S. (2006) Computing over the reals: Foundations for scientific computing Notices of the American Mathematical Society. 53: 318-329 |