Risultati di ricerca
Stephen Arthur Cook (Buffalo, 14 dicembre 1939) è un informatico e matematico statunitense, conosciuto per i suoi contributi nella teoria della complessità computazionale. Ha ricevuto il premio Turing nel 1982.
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.
Stephen Arthur Cook. Canada – 1982. CITATION. For his advancement of our understanding of the complexity of computation in a significant and profound way. His seminal paper, "The Complexity of Theorem Proving Procedures," presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NP-Completeness.
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. Department of Computer Science, University of Toronto. Logic, automata, and computational complexity: The works of Stephen A. Cook …. Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …. Finding hard instances of the satisfiability problem: A survey.
27 mag 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.
