Stephen Cook

Stephen Cook
Cook in 2008
Born
Stephen Arthur Cook

(1939-12-14) December 14, 1939 (age 84)
Buffalo, New York
Alma materHarvard University
University of Michigan
Known forNP-completeness
Propositional proof complexity
Cook–Levin theorem
Awards
Scientific career
FieldsComputer Science
InstitutionsUniversity of Toronto
University of California, Berkeley
Thesis On the Minimum Computation Time of Functions  (1966)
Doctoral advisorHao Wang
Doctoral studentsMark Braverman[1]
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.

  1. ^ Cite error: The named reference mathgenealogy was invoked but never defined (see the help page).