Yahoo Italia Ricerca nel Web

Risultati di ricerca

1. en.wikipedia.org › wiki › Stephen_CookStephen Cook - Wikipedia

   en.wikipedia.org › wiki › Stephen_Cook

   • Cache

   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.

   • Thesis: On the Minimum Computation Time of Functions (1966)

   • Doctoral advisor: Hao Wang

2. it.wikipedia.org › wiki › Stephen_CookStephen Cook - Wikipedia

   it.wikipedia.org › wiki › Stephen_Cook

   • Cache

   Stephen Arthur Cook (Buffalo, 14 dicembre 1939) è un informatico e matematico statunitense, conosciuto per i suoi contributi nella teoria della complessità computazionale. Ha ricevuto il premio Turing nel 1982.

3. Video

   • 

     0:10

     facebook.com

     Stephen Cook Design

     14 feb. 2016

     93 visualizzazioni

   • 

     13:12

     youtube.com

     A conversation with Stephen Cook

     25 gen. 2018

     928 visualizzazioni

   • 

     pantheon.world

     Stephen Cook Biography - American-Canadian computer scientist, contributor to complexity theory

     3 giu. 2020

     313K visualizzazioni

   Mostra tutto

4. www.cs.toronto.edu › ~sacookStephen A. Cook -- Home page - Department of Computer Science ...

   www.cs.toronto.edu › ~sacook

   • Cache

   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.

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

   en.wikipedia.org › wiki › Cook–Levin_theorem

   • Cache

   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.

6. amturing.acm.org › award_winners › cook_n991950Stephen A Cook - A.M. Turing Award Laureate

   amturing.acm.org › award_winners › cook_n991950

   • Cache

   Stephen A Cook - A.M. Turing Award Laureate. PHOTOGRAPHS. Stephen Arthur Cook. Canada – 1982. CITATION. For his advancement of our understanding of the complexity of computation in a significant and profound way.

7. dblp.org › pid › cdblp: Stephen A. Cook

   dblp.org › pid › c

   • Cache

   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.

8. Immagini

   • 
   • 
   • 
   • 

   Mostra tutto

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

   www.britannica.com › biography › Stephen-Arthur-Cook

   • Cache

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