Rectangular matrix multiplication revisited

107Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Coppersmith, D. (1997). Rectangular matrix multiplication revisited. Journal of Complexity, 13(1), 42–49. https://doi.org/10.1006/jcom.1997.0438

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free