Stephen Cook - Wikipedia
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.
Stephen A. Cook -- Home page - Department of Computer …
The P versus NP Problem, Stephen Cook, April, 2000. Manuscript prepared for the Clay Mathematics Institute for the Millennium Prize Problems (revised November, 2000). Click here for the postscript file.
Cook–Levin theorem - Wikipedia
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.
Stephen Arthur Cook | Algorithms, Complexity & NP …
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 …
Stephen A Cook - A.M. Turing Award Laureate
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 A. Cook -- Bio - Department of Computer Science, …
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 Cook: 2020 Centennial Medal Citation - Harvard University
2020年5月27日 · 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.
Stephen Cook - Computer Hope
2019年11月16日 · Short biography of Stephen Cook, an American-Canadian computer scientist and mathematician and one of the forefathers of computational complexity theory.
Stephen Cook: Celebrating a half century of computational …
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 …
Stephen Cook - AceArchive
2023年2月22日 · Stephen Cook is a pioneer in the field of computational complexity theory. His research has led to many important discoveries, including the formulation of the notion of polynomial-time reduction and NP-completeness, and the proof of the existence of an NP-complete problem.