Stephen Cook

E83179

computer scientist person theoretical computer scientist

Stephen Cook is a Canadian-American computer scientist renowned for founding the field of computational complexity theory, particularly through his seminal work on NP-completeness.

Statements (56)

Predicate	Object
instanceOf	computer scientist → person → theoretical computer scientist →
academicDegree	Bachelor of Science in Physics → Master of Science in Computer and Communication Sciences → PhD in Mathematics →
academicTitle	University Professor →
ACMFellow	true →
almaMater	Harvard University → University of Michigan →
awardReceived	BBVA Foundation Frontiers of Knowledge Award in Information and Communication Technologies → CAP-CRM Prize in Theoretical and Mathematical Physics → CRM-Fields-PIMS Prize → EATCS Award → Gerhard Herzberg Canada Gold Medal for Science and Engineering → Guggenheim Fellowship → John L. Synge Award → Killam Prize → NSERC Steacie Fellowship → Order of Canada → Royal Society (London) fellowship → Royal Society of Canada fellowship → Turing Award →
birthDate	1939-12-14 →
birthPlace	Buffalo, New York, United States →
birthYear	1939 →
citizenship	Canada → United States of America →
contributedTo	complexity theory foundations → definition of NP-complete problems → formalization of NP-completeness →
doctoralAdvisor	Hao Wang →
employer	University of Toronto →
familyName	Cook →
fieldOfWork	computational complexity theory → computer science → theoretical computer science →
givenName	Stephen →
influenced	development of modern complexity theory → research on the P versus NP problem →
knownFor	Cook–Levin theorem → NP-completeness → P versus NP problem → foundational work in computational complexity theory →
memberOf	Association for Computing Machinery → Canadian Mathematical Society → Royal Society → Royal Society of Canada →
name	Stephen Cook →
nationality	Canadian-American →
notableWork	"The Complexity of Theorem-Proving Procedures" →
positionHeld	Professor of Computer Science at the University of Toronto → Professor of Mathematics at the University of Toronto →
publicationYear	1971 paper "The Complexity of Theorem-Proving Procedures" →
workInstitution	University of Toronto Department of Computer Science → University of Toronto Department of Mathematics →

Referenced by (2)

Subject (surface form when different)	Predicate
Stephen Cook →	name
Grace Murray Hopper Award →	notableRecipient