Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

Toom–Cook multiplication

Index Toom–Cook multiplication

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. [1]

9 relations: Andrei Toom, Donald Knuth, Gaussian elimination, Karatsuba algorithm, Multiplication algorithm, Positional notation, Schönhage–Strassen algorithm, Stephen Cook, The Art of Computer Programming.

Andrei Toom

Andrei Leonovich Toom (in Russian: Андрей Леонович Тоом), also known as André Toom, (born 1942 in Tashkent, Soviet Union) is a Russian mathematician currently living in New York City, famous for his early work in analysis of algorithms (culminating in the Toom–Cook algorithm), cellular automata (in particular Toom's rule), probability theory and lifelong interest in mathematical education.

New!!: Toom–Cook multiplication and Andrei Toom · See more »

Donald Knuth

Donald Ervin Knuth (born January 10, 1938) is an American computer scientist, mathematician, and professor emeritus at Stanford University.

New!!: Toom–Cook multiplication and Donald Knuth · See more »

Gaussian elimination

In linear algebra, Gaussian elimination (also known as row reduction) is an algorithm for solving systems of linear equations.

New!!: Toom–Cook multiplication and Gaussian elimination · See more »

Karatsuba algorithm

The Karatsuba algorithm is a fast multiplication algorithm.

New!!: Toom–Cook multiplication and Karatsuba algorithm · See more »

Multiplication algorithm

A multiplication algorithm is an algorithm (or method) to multiply two numbers.

New!!: Toom–Cook multiplication and Multiplication algorithm · See more »

Positional notation

Positional notation or place-value notation is a method of representing or encoding numbers.

New!!: Toom–Cook multiplication and Positional notation · See more »

Schönhage–Strassen algorithm

The Schönhage–Strassen algorithm is an asymptotically fast multiplication algorithm for large integers.

New!!: Toom–Cook multiplication and Schönhage–Strassen algorithm · See more »

Stephen Cook

Stephen Arthur Cook, (born December 14, 1939) is an American-Canadian computer scientist and mathematician who has made major contributions to the fields of complexity theory and proof complexity.

New!!: Toom–Cook multiplication and Stephen Cook · See more »

The Art of Computer Programming

The Art of Computer Programming (sometimes known by its initials TAOCP) is a comprehensive monograph written by Donald Knuth that covers many kinds of programming algorithms and their analysis.

New!!: Toom–Cook multiplication and The Art of Computer Programming · See more »

Redirects here:

Tom-Cook multiplication, Tom-Cook multiplication algorithm, Toom multiplication, Toom-Cook, Toom-Cook algorithm, Toom-Cook multiplication, Toom3.

References

[1] https://en.wikipedia.org/wiki/Toom–Cook_multiplication

OutgoingIncoming
Hey! We are on Facebook now! »