Stephen Cook
American-Canadian computer scientist, contributor to complexity theory / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Stephen Cook?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
Not to be confused with Steven Cook.
For other people named Stephen Cook, see Stephen Cook (disambiguation).
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.
Quick Facts OC OOnt, Born ...
Stephen Cook | |
---|---|
Born | Stephen Arthur Cook (1939-12-14) December 14, 1939 (age 84) Buffalo, New York |
Alma mater | Harvard University University of Michigan |
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[1] Toniann Pitassi Walter Savitch Arvind Gupta Anna Lubiw |
Close
He is considered one of the forefathers of computational complexity theory.