Barriers for fast matrix multiplication from irreversibility

Determining the asymptotic algebraic complexity of matrix multiplication, succinctly represented by the matrix multiplication exponent \(\omega\), is a central problem in algebraic complexity theory. The best upper bounds on \(\omega\), leading to the state-of-the-art \(\omega \leq 2.37..\), have be...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Christandl, Matthias, Vrana, Péter, Zuiddam, Jeroen
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 05.03.2022
Subjects:	Algebra Barriers Complexity theory Lower bounds Mathematical analysis Multiplication Multiplication & division Tensors Upper bounds
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!