Lower bounds for the multiplicative complexity of matrix multiplication
From MaRDI portal
Publication:1590075
DOI10.1007/s000370050028zbMath0966.68227MaRDI QIDQ1590075
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
Related Items
An adaptive prefix-assignment technique for symmetry reduction, On the complexity of the multiplication of matrices of small formats, Beyond the Alder-Strassen bound., 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, In search of hyperpaths