Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Stephen Cook
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|American-Canadian computer scientist, contributor to complexity theory}} {{distinguish|Steven Cook}} {{Other people}} {{Use mdy dates|date=February 2023}} {{Infobox scientist | name = Stephen Cook | honorific_suffix = {{Post-nominals|country=CAN|size=100%|sep=|OC|OOnt}} | birth_name = Stephen Arthur Cook | image = Prof.Cook.jpg | image_upright = | caption = Cook in 2008 | birth_date = {{birth date and age|1939|12|14}} | birth_place = [[Buffalo, New York|Buffalo]], New York | death_date = | death_place = | residence = | citizenship = | nationality = | ethnicity = | field = [[Computer Science]] | work_institution = [[University of Toronto]]<br>[[University of California, Berkeley]] | education = [[University of Michigan]] ([[Bachelor of Arts|BA]])<br>[[Harvard University]] ([[Master of Arts|MA]], [[Doctor of Philosophy|PhD]]) | thesis_title = On the Minimum Computation Time of Functions | thesis_url = <!--(or | thesis1_url = and | thesis2_url = )--> | thesis_year = 1966 | doctoral_advisor = [[Hao Wang (academic)|Hao Wang]] | doctoral_students = [[Mark Braverman (mathematician)|Mark Braverman]]<ref name="mathgenealogy"/><br> [[Toniann Pitassi]] <br> [[Walter Savitch]] <br> [[Arvind Gupta (academic)|Arvind Gupta]] <br> [[Anna Lubiw]] | known_for = [[NP-complete]]ness <br> Propositional [[proof complexity]] <br> [[Cook–Levin theorem]] | author_abbreviation_bot = | author_abbreviation_zoo = | prizes = {{plainlist| * [[Turing Award]] {{small|(1982)}} * [[Gödel Lecture]] {{small|(1999)}} * [[CRM-Fields-PIMS prize]] {{small|(1999)}} * [[John L. Synge Award]] {{small|(2006)}} * [[Bernard Bolzano Medal]] {{small|(2008)}} * [[Gerhard Herzberg Canada Gold Medal for Science and Engineering]] {{small|(2012)}} * [[Order of Canada|Officer of Order of Canada]] {{small|(2015)}} * [[BBVA Foundation Frontiers of Knowledge Award]] {{small|(2015)}} }} | religion = | footnotes = }} '''Stephen Arthur Cook''' {{Post-nominals|country=CAN|size=100%|OC|OOnt}} (born December 14, 1939) is an American-Canadian [[computer scientist]] and mathematician who has made significant contributions to the fields of [[computational complexity theory|complexity theory]] and [[proof complexity]]. He is a university professor emeritus at the [[University of Toronto]], Department of Computer Science and [[University of Toronto Department of Mathematics|Department of Mathematics]]. He is considered one of the forefathers of [[computational complexity theory]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)