This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix multiplication decompositions, give a geometric proof of the theorem of Burichenko's theorem establishing the symmetry group of Strassen's algorithm, and present two particularly nice subfamilies in the Strassen family of decompositions
We introduce a relaxation of the notion of tensor rank, called s-rank, and show that upper bounds on...
The article is concerned with the problem of the additivity of the tensor rank. That is for two inde...
The study of the ranks and border ranks of tensors is an active area of research. By the example of ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
This is the second in a series of papers on rank decompositions of the matrix multiplication tensor....
This is the second in a series of papers on rank decompositions of the matrix multiplication tensor....
Matrix multiplication is commonly used in scientific computation. Given matrices A = (aij ) of size ...
In this thesis, we tackle the problem of matrix multiplication complexity. Matrix multiplication, wh...
Determining the complexity of matrix multiplication has been a central problem in complexity theory ...
Despite its importance, all proofs of the correctness of Strassen's famous 1969 algorithm to multipl...
textabstractWe show that the border support rank of the tensor corresponding to two-by-two matrix m...
An important building block in all current asymptotically fast algorithms for matrix multiplication ...
We prove that the border rank of the Kronecker square of the little Coppersmith–Winograd tensor Tcw,...
We introduce a relaxation of the notion of tensor rank, called s-rank, and show that upper bounds on...
The article is concerned with the problem of the additivity of the tensor rank. That is for two inde...
The study of the ranks and border ranks of tensors is an active area of research. By the example of ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
This is the second in a series of papers on rank decompositions of the matrix multiplication tensor....
This is the second in a series of papers on rank decompositions of the matrix multiplication tensor....
Matrix multiplication is commonly used in scientific computation. Given matrices A = (aij ) of size ...
In this thesis, we tackle the problem of matrix multiplication complexity. Matrix multiplication, wh...
Determining the complexity of matrix multiplication has been a central problem in complexity theory ...
Despite its importance, all proofs of the correctness of Strassen's famous 1969 algorithm to multipl...
textabstractWe show that the border support rank of the tensor corresponding to two-by-two matrix m...
An important building block in all current asymptotically fast algorithms for matrix multiplication ...
We prove that the border rank of the Kronecker square of the little Coppersmith–Winograd tensor Tcw,...
We introduce a relaxation of the notion of tensor rank, called s-rank, and show that upper bounds on...
The article is concerned with the problem of the additivity of the tensor rank. That is for two inde...
The study of the ranks and border ranks of tensors is an active area of research. By the example of ...