Lower bounds for the multiplicative complexity of matrix multiplication

DOI10.1007/s000370050028zbMath0966.68227OpenAlexW2003870914MaRDI QIDQ1590075

Markus Bläser

Publication date: 19 December 2000

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000370050028

zbMATH Keywords

multiplicative complexity of matrix multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (6)

An introduction to the computational complexity of matrix multiplication ⋮ Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science ⋮ On the complexity of the multiplication of matrices of small formats ⋮ In search of hyperpaths ⋮ Beyond the Alder-Strassen bound. ⋮ An adaptive prefix-assignment technique for symmetry reduction

This page was built for publication: Lower bounds for the multiplicative complexity of matrix multiplication