Resultado da Busca
Stephen A. Cook: Towards a Complexity Theory of Synchronous Parallel Computation. Logic, Automata, and Computational Complexity 2023: 219-244. [p3] Allan Borodin, Stephen A. Cook: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation. Logic, Automata, and Computational Complexity 2023: 245-260.
27 de mai. de 2020 · Stephen Cook, for your fundamental work on the theory of NP-completeness, which has shaped the course of research and teaching in theoretical computer science, and for your ongoing exploration of the questions that arise from this theory, which are among the most important in computer science and mathematics today, we are proud to award you the 2020 Centennial Medal.
Stephen Arthur Cook (Buffalo, Nueva York, Estados Unidos; 1939) ostenta la doble nacionalidad estadounidense y canadiense. Hijo de un químico y un ama de casa con dos máster (en Inglés y en Historia), su primera vocación fue la ciencia aplicada.
Department of Computer Science, University of Toronto - Cited by 25,297 - Computational Complexity - Proof Complexity
23 de mai. de 2023 · Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook won the 1982 Turing Award for “his advancement of our understanding of the complexity of computation in a significant and profound way.”
Stephen Cook. Stephen Arthur Cook (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. Read more on Wikipedia. Since 2007, the English Wikipedia page of Stephen Cook has received more than 317,078 page views.
18 de abr. de 2024 · Stephen A. Cook University of Toronto. Primary Section: 34, Computer and Information Sciences Secondary Section: 11, Mathematics Membership Type: Member ...
