Pioneer
Stephen Cook
Also Known As Stephen Arthur Cook · Stephen A. Cook · S. A. Cook
Theory of Computation
Stephen Arthur Cook is an American-Canadian computer scientist and mathematician who has made significant contributions to complexity theory and proof complexity. He is a university professor emeritus at the University of Toronto. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
AwardGerhard Herzberg Canada Gold Medal for Science and Engineering 1 AwardOfficer of the Order of Canada 1 AwardFellow of the Royal Society 1 AwardFellow of the Royal Society of Canada 1 AwardBBVA Foundation Frontiers of Knowledge Award 1 Stephen Cook
Filter Results1 entry
Connections
Credited
Source Toom-Cook multiplication (Wikipedia)
In Field
Source Wikipedia: Stephen Cook
Invented
Stephen Cook improved Andrei Toom's fast multiplication algorithm in his 1966 doctoral thesis at Harvard.
Source Wikipedia: Stephen Cook
In the Other Atlases
Same As
Also in Mathematics Atlas: the same subject.
Is Discussed By
Also in Science Atlas: which discusses this subject.
Source Wikipedia: Stephen Cooktier 2
Nationality
Also in Geography Atlas: the nationality of this subject.
Also in Geography Atlas: the nationality of this subject.
Sources
1. Wikidata: Stephen Cook
- Wikidata Q62870, resolved via en.wikipedia pageprops (wave rule R-L)
- Wikidata Q62870 P569 (date of birth)
View the Source2. Wikipedia: Stephen Cook
Wikimedia FoundationLead section
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.
Infobox, Born
December 14, 1939
- In Field: Theory of Computation, Lead paragraph
View the Source Toom-Cook multiplication (Wikipedia)
Credited: Toom-Cook Multiplication, Lead sentenceQuote, Credited: Toom-Cook Multiplication, Lead sentence
Toom-Cook, sometimes known as Toom-3, named after Andrei Toom, who introduced the new algorithm with its low complexity, and Stephen Cook, who cleaned the description of it, is a multiplication algorithm for large integers.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.