Nimrod Megiddo
Journal of Symbolic Computation
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
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
Charles A Micchelli
Journal of Approximation Theory
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics