Journal of Complexity

Paper

01 Jan 1997

Rectangular matrix multiplication revisited

View publication

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

Paper

A generic grouping algorithm and its quantitative analysis

Arnon Amir, Michael Lindenbaum

IEEE Transactions on Pattern Analysis and Machine Intelligence

Paper

Each four-celled animal tiles the plane

Don Coppersmith

Journal of Combinatorial Theory, Series A

Conference paper

Integration of polymer self-assembly for lithographic application

Joy Y. Cheng, Daniel P. Sanders, et al.

SPIE Advanced Lithography 2008

Paper

A Direct Method for Solving Linear Systems

M. Tismenetsky

International Journal of Computer Mathematics

View all publications