Fast Matrix Multiplication - Part 2
Bilinear Algorithms, Tensors and the Tensor rank
12 minute
theory
matrix-multiplication
tensors
Here are all published articles, sorted by date in descending order.
Bilinear Algorithms, Tensors and the Tensor rank
Matrix Multiplication is sub-cubic (Strassen's algorithm)
Using Grothendick's identity to obtain an approximate algorithm for computing the Cut-Norm of a matrix
Using Grothendick's identity to obtain a randomized approximate algorithm for computing the Cut-Norm of a matrix
Using linear algebra to improve upon gradient-descent for solving linear equations
Basics of Matroid Theory and Infinite Extensions
Enter keywords to search articles