Toom-Cook, sometimes called Toom-3, is a multiplication algorithm for large integers named for Andrei Toom, who introduced it, and Stephen Cook, who clarified its description. It splits two large integers into smaller parts, performs a reduced number of multiplications on those parts, and combines the results, and the widely used Karatsuba algorithm is the special case of Toom-Cook where the number is split into just two parts.
Connections
Credited To
Source Toom-Cook multiplication (Wikipedia)
In Field
Source Toom-Cook multiplication (Wikipedia)
Invented By
Stephen Cook improved Andrei Toom's fast multiplication algorithm in his 1966 doctoral thesis at Harvard.
Source Wikipedia: Stephen Cook
Sources
Toom-Cook multiplication (Wikipedia)
In Field: Algorithms and Complexity Theory, 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.
Credited To: Stephen Cook, 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.
View the SourceReader 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.