Algebraic and numerical algorithms

Algorithms on numbers, polynomials and matrices: integer and polynomial multiplication (Karatsuba, FFT and convolution), matrix multiplication (iterative, recursive, Strassen), Horner evaluation, floating-point rounding, modular exponentiation and linear congruences, Miller-Rabin primality testing, and bit-level polynomial and bitvector arithmetic.

• Bitvectors and Boolean lists
• Binary polynomial arithmetic on bitvectors
• Fast Fourier transform
• Floating-point rounding
• Horner's method
• Karatsuba algorithm
• Matrix multiplication algorithms
• Modular exponentiation
• Miller–Rabin primality test
• Solving linear congruences
• Strassen algorithm

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.