Algebraic Techniques for Fast Integer Multiplication
Different algebraic techniques and tricks used to derive fast integer multiplication algorithms
17 minute
algebraic-algorithms
algebra
fft
algorithms
All posts under category "Theory"
Different algebraic techniques and tricks used to derive fast integer multiplication algorithms
A generalized algebraic approach to the FFT, extending beyond the complex numbers to finite fields and arbitrary rings
The $\tau$-theorem, obtaining upper bounds on $\omega$ from independent matrix multiplication tensors
Ways to manipulate tensors - the tensor product, direct sum, symmetrization and restriction
Bilinear Algorithms, Tensors and the Tensor rank
Matrix Multiplication is sub-cubic (Strassen's algorithm)
Basics of Matroid Theory and Infinite Extensions
Enter keywords to search articles