Beyond the Alder-Strassen bound.
From MaRDI portal
Publication:1770421
DOI10.1016/j.tcs.2004.09.029zbMath1083.68046OpenAlexW2038253106MaRDI QIDQ1770421
Publication date: 6 April 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.029
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
On the nuclear norm and the singular value decomposition of tensors ⋮ Optimization techniques for small matrix multiplication ⋮ Tripartite Entanglement Transformations and Tensor Rank
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Rank and optimal computation of generic tensors
- Lectures on the complexity of bilinear problems
- On the algorithmic complexity of associative algebras
- On the optimal evaluation of a set of bilinear forms
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- The complexity of bivariate power series arithmetic.
- Lower bounds for the multiplicative complexity of matrix multiplication
- Gaussian elimination is not optimal
- Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
- Relative bilinear complexity and matrix multiplication.
- Partial and Total Matrix Multiplication
- A Lower Bound for Matrix Multiplication
- Lower bounds for the bilinear complexity of associative algebras
This page was built for publication: Beyond the Alder-Strassen bound.
