| About CRA |
| CRA for Students |
| CRA for Faculty |
| Events |
| Jobs |
| Government Affairs |
| Computing Research Blog |
| CRA-Women |
| Projects |
| Publications |
| Data & Resources |
| Membership |
| What's New |
|
Home |
Cooks Wins Canadian Award
| Date: | May 1997 |
| Section: | Awards |
Stephen A. Cook of the Department of Computer Science at the University of Toronto was awarded the Canadian Council's Walton Killam Memorial Prize for Engineering/Computer Science. The $50,000 (Canadian) Killam Prizes are Canada's most distinguished annual awards given in recognition of outstanding achievements by Canadians in any of the disciplines in the natural sciences, health science and engineering.
Cook originated the field of NP-completeness and helped establish strong links between mathematical logic and complexity of computations. His 1971 paper "The Complexity of Theorem Proving Procedures" is universally regarded as the most important paper in theoretical computer science, an announcement from the Canadian Council said.
