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 ...
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.
On the minimum computation time of functions. SA Cook, SO Aanderaa. Transactions of the American Mathematical Society 142, 291-314. , 1969. 500. 1969. Characterizations of pushdown machines in terms of time-bounded computers. SA Cook. Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook ….
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.
27 de mai. de 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.
Stephen Arthur Cook (born Dec. 14, 1939, Buffalo, N.Y., U.S.) 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.”
