Yahoo Italia Ricerca nel Web

Entra

Risultati di ricerca

  1. gsas.harvard.edu › news › stephen-cook-2020-centennial-medalStephen Cook: 2020 Centennial Medal Citation - Harvard University

    27 mag 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.

  2. scholar.google.com.hk › citations‪Stephen Cook‬ - ‪Google Scholar‬

    The relative efficiency of propositional proof systems. SA Cook, RA Reckhow. Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …. , 2023. 1241. 2023. A taxonomy of problems with fast parallel algorithms. SA Cook. Information and control 64 (1-3), 2-22.

  3. www.cs.toronto.edu › ~sacook › homepageStephen A. Cook -- Bio - Department of Computer Science,...

    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. He has made extensive contributions to computational complexity, including his 1971 paper introducing the theory of NP ...

  4. www.britannica.com › biography › Stephen-Arthur-CookStephen Arthur Cook | Algorithms, Complexity & NP-Completeness

    1 mag 2024 · Stephen Arthur Cook 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.” Cook earned a bachelor’s degree (1961) in computer

  5. en.wikipedia.org › wiki › Cook–Levin_theoremCook–Levin theorem - Wikipedia

    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. The theorem is named after Stephen Cook ...

  6. www.stephencook.netStephen Cook, pianist | composer

    Stephen Cook, pianist | composer

  7. dl.acm.org › doi › bookLogic, Automata, and Computational Complexity: The Works of ...

    23 mag 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.”