Stephen Cook
Stephen Cook | |
|---|---|
Cook in 2008 | |
| Born | Stephen Arthur Cook December 14, 1939 Buffalo, New York |
| Education | University of Michigan (BA) Harvard University (MA, PhD) |
| Known for | NP-completeness Propositional proof complexity Cook–Levin theorem |
| Awards |
|
| Scientific career | |
| Fields | Computer Science |
| Institutions | University of Toronto University of California, Berkeley |
| Thesis | On the Minimum Computation Time of Functions (1966) |
| Doctoral advisor | Hao Wang |
| Doctoral students | Mark Braverman Toniann Pitassi Walter Savitch Arvind Gupta Anna Lubiw |
Stephen Arthur Cook OC OOnt (born December 14, 1939) is an American-Canadian computer scientist and mathematician who has made significant contributions to the fields of complexity theory and proof complexity. He is a university professor emeritus at the University of Toronto, Department of Computer Science and Department of Mathematics.
He is considered one of the forefathers of computational complexity theory.