This is a survey primarily about determining the border rank of tensors, especially those relevant for the study of the complexity of matrix multiplication. This is a subject that on the one hand is of great significance in theoretical computer science, and on the other hand touches on many beautiful topics in algebraic geometry such as classical and recent results on equations for secant varieties (e.g., via vector bundle and representation-theoretic methods) and the geometry and deformation theory of zero dimensional schemes
We consider here the problem, which is quite classical in Algebraic geometry, of studying the secant...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
AbstractWe expound new approaches to the analysis of algebraic complexity based on synthetic and alg...
This is a survey primarily about determining the border rank of tensors, especially those relevant f...
Matrix multiplication is commonly used in scientific computation. Given matrices A = (aij ) of size ...
textabstractWe show that the border support rank of the tensor corresponding to two-by-two matrix m...
A classical unsolved problem of projective geometry is that of finding the dimensions of all the (hi...
Abstract. This paper studies the dimension of secant varieties to Segre va-rieties. The problem is c...
AbstractA classical unsolved problem of projective geometry is that of finding the dimensions of all...
In this lecture I introduce two problems in complexity: determining the complexity of matrix multipl...
A tensor is a multi-dimensional data array, occurring ubiquitously in mathematics, physics, engineer...
An important building block in all current asymptotically fast algorithms for matrix multiplication ...
AbstractThe action of commutativity and approximation is analyzed for some problems in Computational...
In this article, I will first give a criterion for a generic m × n × n tensor to have rank n using s...
We consider here the problem, which is quite classical in Algebraic geometry, of studying the secant...
We consider here the problem, which is quite classical in Algebraic geometry, of studying the secant...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
AbstractWe expound new approaches to the analysis of algebraic complexity based on synthetic and alg...
This is a survey primarily about determining the border rank of tensors, especially those relevant f...
Matrix multiplication is commonly used in scientific computation. Given matrices A = (aij ) of size ...
textabstractWe show that the border support rank of the tensor corresponding to two-by-two matrix m...
A classical unsolved problem of projective geometry is that of finding the dimensions of all the (hi...
Abstract. This paper studies the dimension of secant varieties to Segre va-rieties. The problem is c...
AbstractA classical unsolved problem of projective geometry is that of finding the dimensions of all...
In this lecture I introduce two problems in complexity: determining the complexity of matrix multipl...
A tensor is a multi-dimensional data array, occurring ubiquitously in mathematics, physics, engineer...
An important building block in all current asymptotically fast algorithms for matrix multiplication ...
AbstractThe action of commutativity and approximation is analyzed for some problems in Computational...
In this article, I will first give a criterion for a generic m × n × n tensor to have rank n using s...
We consider here the problem, which is quite classical in Algebraic geometry, of studying the secant...
We consider here the problem, which is quite classical in Algebraic geometry, of studying the secant...
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. ...
AbstractWe expound new approaches to the analysis of algebraic complexity based on synthetic and alg...