Stephen A. Cook

E1045586

Stephen A. Cook is a Canadian-American computer scientist best known for founding the theory of NP-completeness and making seminal contributions to computational complexity theory.

Try in SPARQL Jump to: Surface forms Statements Referenced by

All labels observed (1)

Label Occurrences
Stephen A. Cook canonical 1

Statements (49)

Predicate Object
instanceOf computer scientist
human
mathematician
theoretical computer scientist
university teacher
academicDegree Bachelor of Science
Doctor of Philosophy
Master of Science
awardReceived EATCS Award NERFINISHED
Gerhard Herzberg Canada Gold Medal for Science and Engineering NERFINISHED
Jeffery–Williams Prize NERFINISHED
John L. Synge Award NERFINISHED
Order of Canada
Turing Award
birthPlace Buffalo, New York NERFINISHED
citizenship American
Canadian
countryOfCitizenship Canada
United States of America
dateOfBirth 1939-12-14
doctoralThesis The Complexity of Theorem-Proving Procedures NERFINISHED
doctoralThesisYear 1966
educatedAt Harvard University
University of Michigan
employer University of Toronto NERFINISHED
familyName Cook NERFINISHED
fieldOfWork computational complexity theory
computer science
mathematical logic
theoretical computer science
givenName Stephen NERFINISHED
hasAcademicAdvisor Wang Hao NERFINISHED
influenced complexity theory research
theory of algorithms
knownFor Cook–Levin theorem NERFINISHED
P versus NP problem NERFINISHED
contributions to computational complexity theory
founding the theory of NP-completeness
work on satisfiability problem
languageOfWorkOrName English
memberOf American Academy of Arts and Sciences
National Academy of Sciences
Royal Society of Canada NERFINISHED
notableStudent Juris Hartmanis NERFINISHED
Moshe Y. Vardi NERFINISHED
notableWork The Complexity of Theorem-Proving Procedures NERFINISHED
positionHeld professor
sexOrGender male
workLocation Toronto NERFINISHED

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

"The Complexity of Theorem-Proving Procedures" author Stephen A. Cook
subject surface form: The Complexity of Theorem-Proving Procedures