Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
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
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Martin C. Gutzwiller
Physica D: Nonlinear Phenomena