Resultado da Busca
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.
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.
- On the Minimum Computation Time of Functions (1966)
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.
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.
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.”
- William L. Hosch
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.
Steven A. Cook is the Eni Enrico Mattei senior fellow for Middle East and Africa studies at the Council on Foreign Relations (CFR). He is the author of False Dawn: Protest, Democracy, and Violence in the New Middle East (Oxford University Press, 2017).
