Rapid Multiplication of Rectangular Matrices

DOI10.1137/0211037zbMath0486.68031OpenAlexW2158695970MaRDI QIDQ3947118

No author found.

Publication date: 1982

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

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

zbMATH Keywords

algebraic complexitytensor rankmatrix multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Cryptography from Learning Parity with Noise, Faster All-Pairs Shortest Paths via Circuit Complexity, Nonuniform ACC Circuit Lower Bounds, Rectangular matrix multiplication revisited, Parallel evaluation of the determinant and of the inverse of a matrix, On the arithmetic complexity of matrix Kronecker powers, Fast matrix multiplication and its algebraic neighbourhood, On the asymptotic complexity of rectangular matrix multiplication, Fast rectangular matrix multiplication and some applications, New algorithms and lower bounds for circuits with linear threshold gates, A note on compressed sensing and the complexity of matrix multiplication, A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma, Unnamed Item, Fast rectangular matrix multiplication and applications, $$P\mathop{ =}\limits^{?}NP$$, Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors, Using fast matrix multiplication to find basic solutions, Algorithms and lower bounds for de morgan formulas of low-communication leaf gates, Unnamed Item, From Circuit Complexity to Faster All-Pairs Shortest Paths, Efficient Construction of Rigid Matrices Using an NP Oracle