The complexity of matrix multiplication: developments since 2014. Extended abstract of 2018 Oberwolfach Complexity meeting plenary lecture

11/28/2018
by   Joseph M. Landsberg, et al.
0

This is an overview of recent developments regarding the complexity of matrix multiplication, with an emphasis on the uses of algebraic geometry and representation theory in complexity theory.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2017

A rank 18 Waring decomposition of sM_〈 3〉 with 432 symmetries

The recent discovery that the exponent of matrix multiplication is deter...
research
03/30/2022

Matrix Multiplication with Less Arithmetic Complexity and IO Complexity

After Strassen presented the first sub-cubic matrix multiplication algor...
research
03/04/2022

Beyond Time Complexity: Data Movement Complexity Analysis for Matrix Multiplication

Data movement is becoming the dominant contributor to the time and energ...
research
06/07/2019

Optimal algebraic Breadth-First Search for sparse graphs

There has been a rise in the popularity of algebraic methods for graph a...
research
08/01/2022

On Matrix Multiplication and Polynomial Identity Testing

We show that lower bounds on the border rank of matrix multiplication ca...
research
03/27/2023

Algebraic Geometry Codes for Secure Distributed Matrix Multiplication

In this paper, we propose a novel construction for secure distributed ma...

Please sign up or login with your details

Forgot password? Click here to reset