Search results
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.
In 1985, Stephen Cook was promoted to the position of University Professor at the University of Toronto, and now holds the position of Distinguished University Professor in the Computer Science and Mathematics Departments.
Stephen Arthur Cook (born Dec. 14, 1939, Buffalo, N.Y., U.S.) is an American computer scientist and winner of the 1982 A.M. Turing Award, the highest honour in computer science, for his “advancement of our understanding of the complexity of computation in a significant and profound way.”
Stephen A. Cook. University Professor Emeritus Department of Computer Science University of Toronto Toronto, Canada M5S 3G4. Tel: (416) 978-5183 sacook [at] cs [dot] toronto [dot] edu Office: Sandford Fleming 2303C. I am a member of the Theory Group in the Computer Science Department.
May 27, 2020 · Stephen Cook is the foundational thinker behind this field-defining question. Cook was an undergraduate at the University of Michigan and earned his PhD in mathematics at Harvard in 1966; his dissertation, on the computational complexity of multiplication, improved an essential algorithm now known as Toom-Cook multiplication.
In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete. That is, it is in NP, and any problem in NP can be reduced in polynomial time by a deterministic Turing machine to the Boolean satisfiability problem.
Nov 16, 2019 · American-Canadian computer scientist and mathematician. Known for NP-completeness, propositional proof complexity and the Cook-Levin theorem. Recognized as one of the forefathers of computational complexity theory.
Jun 11, 2019 · The event celebrated fifty years of computational complexity and the groundbreaking contribution to the field made by Cook, a professor in U of T’s Department of Computer Science. In 1971, Cook defined a class of NP problems called NP-complete that appeared to be fundamentally unsolvable.
Stephen Cook is University Professor Emeritus of Computer Science at the University of Toronto. He is the 1982 Turing Award Winner and the 2012 winner of the NSERC Gerhard Herzberg Canada Gold Medal for Science and Engineering.
Stephen A. Cook. University of Toronto. Primary Section: 34, Computer and Information Sciences. Secondary Section: 11, Mathematics. Membership Type: Member (elected 1985) Research Interests. My primary research interest is theoretical computer science, especially computational complexity and its relationship to mathematical logic. Related Links.
