Resultado da Busca
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. He is a university professor emeritus at the University of Toronto, Department of Computer Science and Department of Mathematics.
- On the Minimum Computation Time of Functions (1966)
Stephen Arthur Cook, (Buffalo, 14 de dezembro de 1939) é um cientista da computação e matemático estadunidense-canadense, que teve maior contribuição no campo da teoria da complexidade e complexidade de prova. É professor de informática da Universidade de Toronto, Departamento de Ciência da Computação e Departamento de ...
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 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.
The theorem is named after Stephen Cook and Leonid Levin. The proof is due to Richard Karp, based on an earlier proof (using a different notion of reducibility) by Cook.
Stephen Cook. Department of Computer Science, University of Toronto. Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …. Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …. Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …. Logic, Automata, and ...
1 de mai. de 2024 · 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.”
