License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CCC.2019.26
URN: urn:nbn:de:0030-drops-108487
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10848/
Christandl, Matthias ;
Vrana, Péter ;
Zuiddam, Jeroen
Barriers for Fast Matrix Multiplication from Irreversibility
Abstract
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 <= 2.37.., have been obtained via the laser method of Strassen and its generalization by Coppersmith and Winograd. Recent barrier results show limitations for these and related approaches to improve the upper bound on omega.
We introduce a new and more general barrier, providing stronger limitations than in previous work. Concretely, we introduce the notion of "irreversibility" of a tensor and we prove (in some precise sense) that any approach that uses an irreversible tensor in an intermediate step (e.g., as a starting tensor in the laser method) cannot give omega = 2. In quantitative terms, we prove that the best upper bound achievable is lower bounded by two times the irreversibility of the intermediate tensor. The quantum functionals and Strassen support functionals give (so far, the best) lower bounds on irreversibility. We provide lower bounds on the irreversibility of key intermediate tensors, including the small and big Coppersmith - Winograd tensors, that improve limitations shown in previous work. Finally, we discuss barriers on the group-theoretic approach in terms of "monomial" irreversibility.
BibTeX - Entry
@InProceedings{christandl_et_al:LIPIcs:2019:10848,
author = {Matthias Christandl and P{\'e}ter Vrana and Jeroen Zuiddam},
title = {{Barriers for Fast Matrix Multiplication from Irreversibility}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {26:1--26:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Amir Shpilka},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10848},
URN = {urn:nbn:de:0030-drops-108487},
doi = {10.4230/LIPIcs.CCC.2019.26},
annote = {Keywords: Matrix multiplication exponent, barriers, laser method}
}
|
Keywords: |
|
Matrix multiplication exponent, barriers, laser method |
|
Collection: |
|
34th Computational Complexity Conference (CCC 2019) |
|
Issue Date: |
|
2019 |
|
Date of publication: |
|
16.07.2019 |
