Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Toom-Cook Multiplication

Numerical Algorithm

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

Invented By

Stephen Cook, Pioneers

Stephen Cook improved Andrei Toom's fast multiplication algorithm in his 1966 doctoral thesis at Harvard.

Source Wikipedia: Stephen Cook
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.