A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras
2020
International Symposium on Mathematical Foundations of Computer Science
Determining the exponent of matrix multiplication ω is one of the central open problems in algebraic complexity theory. All approaches to design fast matrix multiplication algorithms follow the following general pattern: We start with one "efficient" tensor T of fixed size and then we use a way to get a large matrix multiplication out of a large tensor power of T. In the recent years, several so-called barrier results have been established. A barrier result shows a lower bound on the best upper
doi:10.4230/lipics.mfcs.2020.17
dblp:conf/mfcs/BlaserL20
fatcat:z4czwp3jtjcntlytr6qqydvhje