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...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Christandl, Matthias, Vrana, Péter, Zuiddam, Jeroen
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 05.03.2022
Predmet:	Algebra Barriers Complexity theory Lower bounds Mathematical analysis Multiplication Multiplication & division Tensors Upper bounds
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!