Engineering↗
Asymptotic Cost of Integer Multiplication
The M(n) abstraction, the hierarchy of multiplication algorithms, and why downstream bounds are quoted in terms of M(n) rather than fixed exponents.
Every page in the KEVOS library tagged Toom-Cook. 3 pages.
The M(n) abstraction, the hierarchy of multiplication algorithms, and why downstream bounds are quoted in terms of M(n) rather than fixed exponents.
Schoolbook, Karatsuba and evaluation-interpolation methods for polynomial multiplication, and where the crossovers lie.
Representation of multiprecision integers, schoolbook and fast multiplication, division, modular reduction strategies, and how to choose the right base ring for a computation.