Faster access than browser!
13 relations: Anatoly Karatsuba, Andrei Toom, Arbitrary-precision arithmetic, Binary splitting, Computational complexity of mathematical operations, Division algorithm, Karatsuba algorithm, List of algorithms, List of numerical analysis topics, Multiplication, Pi, Polynomial interpolation, Schönhage–Strassen algorithm.
Anatoly Karatsuba
Anatoly Alexeevitch Karatsuba (Анато́лий Алексе́евич Карацу́ба; Grozny, Soviet Union, January 31, 1937 – Moscow, Russia, September 28, 2008) was a Russian mathematician working in the field of analytic number theory, ''p''-adic numbers and Dirichlet series.
New!!: Toom–Cook multiplication and Anatoly Karatsuba · See more »
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 »
Arbitrary-precision arithmetic
In computer science, arbitrary-precision arithmetic, also called bignum arithmetic, multiple-precision arithmetic, or sometimes infinite-precision arithmetic, indicates that calculations are performed on numbers whose digits of precision are limited only by the available memory of the host system.
New!!: Toom–Cook multiplication and Arbitrary-precision arithmetic · See more »
Binary splitting
In mathematics, binary splitting is a technique for speeding up numerical evaluation of many types of series with rational terms.
New!!: Toom–Cook multiplication and Binary splitting · See more »
Computational complexity of mathematical operations
The following tables list the computational complexity of various algorithms for common mathematical operations.
New!!: Toom–Cook multiplication and Computational complexity of mathematical operations · See more »
Division algorithm
A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder, the result of division.
New!!: Toom–Cook multiplication and Division algorithm · See more »
Karatsuba algorithm
The Karatsuba algorithm is a fast multiplication algorithm.
New!!: Toom–Cook multiplication and Karatsuba algorithm · See more »
List of algorithms
The following is a list of algorithms along with one-line descriptions for each.
New!!: Toom–Cook multiplication and List of algorithms · See more »
List of numerical analysis topics
This is a list of numerical analysis topics.
New!!: Toom–Cook multiplication and List of numerical analysis topics · See more »
Multiplication
Multiplication (often denoted by the cross symbol "×", by a point "⋅", by juxtaposition, or, on computers, by an asterisk "∗") is one of the four elementary mathematical operations of arithmetic; with the others being addition, subtraction and division.
New!!: Toom–Cook multiplication and Multiplication · See more »
Pi
The number is a mathematical constant.
New!!: Toom–Cook multiplication and Pi · See more »
Polynomial interpolation
In numerical analysis, polynomial interpolation is the interpolation of a given data set by the polynomial of lowest possible degree that passes through the points of the dataset.
New!!: Toom–Cook multiplication and Polynomial interpolation · 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 »
Redirects here:
Tom-Cook multiplication, Tom-Cook multiplication algorithm, Toom multiplication, Toom-Cook, Toom-Cook algorithm, Toom-Cook multiplication, Toom3.
