The I/O complexity of Strassen's matrix multiplication with recomputation

DOI10.1007/978-3-319-62127-2_16zbMath1491.68274arXiv1605.02224OpenAlexW2963372459MaRDI QIDQ2405285

Lorenzo De Stefani, Gianfranco Bilardi

Publication date: 22 September 2017

Full work available at URL: https://arxiv.org/abs/1605.02224

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions

This page was built for publication: The I/O complexity of Strassen's matrix multiplication with recomputation