Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Paper
Rectangular matrix multiplication revisited
Abstract
We give a constant α > 0.294 and, for any ε > 0, an algorithm for multiplying anN×Nmatrix by anN×Nαmatrix with complexityO(N2 + ε). © 1997 Academic Press.
Related
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
Conference paper
Generative Adversarial Symmetry Discovery
Jianke Yang, Robin Walters, et al.
ICML 2023