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.
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.
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.”
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 Cook is a renowned computer scientist and Turing Award winner. He is known for his work on computational complexity, NP completeness, and propositional proof complexity.
Stephen Cook. Department of Computer Science, University of Toronto. Vahvistettu sähköpostiosoite verkkotunnuksessa cs.toronto.edu. Computational Complexity Proof Complexity. Artikkelit 1–20. Department of Computer Science, University of Toronto - 25 336 viittausta - Computational Complexity - Proof Complexity.
