|
|
| Name |
Cook, Stephen A. |
| Location
|
University of Toronto |
| Primary Field
|
Computer and Information Sciences |
| Secondary Field
|
Mathematics |
 Election Citation
|
|
Cook has made important contributions to many areas of theoretical computer science, ranging from the complexity of multiplication to mechanical theorem proving. His most important contribution was in starting the study of NP completeness. Hundreds of papers followed his ground-breaking 1971 work, and the paradigm he established is by now a standard tool of research in theoretical computer science. |
|
Research Interests
|
|
My primary research interest is theoretical computer science, especially computational complexity and its relationship to mathematical logic. |
|
|
|