Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication

DOI10.1137/0211020zbMath0478.68041OpenAlexW2033190478MaRDI QIDQ3936193

Francesco Romani

Publication date: 1982

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0211020

zbMATH Keywords

tensor ranktranscendental equationexponent for matrix multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (11)

A note on VNP-completeness and border complexity ⋮ Fast commutative matrix algorithms ⋮ On the order of approximation in approximative triadic decompositions of tensors ⋮ An introduction to the computational complexity of matrix multiplication ⋮ Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation ⋮ The bit-operation complexity of matrix multiplication and of all pair shortest path problem ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication ⋮ On the asymptotic complexity of rectangular matrix multiplication ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations

This page was built for publication: Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication