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

Each four-celled animal tiles the plane

Don Coppersmith

Journal of Combinatorial Theory, Series A

Conference paper

Compression for data archiving and backup revisited

Corneliu Constantinescu

SPIE Optical Engineering + Applications 2009

Conference paper

Compression scheme for digital cinema application

Ligang Lu, Jack L. Kouloheris

IS&T/SPIE Electronic Imaging 2002

Talk

Nesterov Accelerated Shuffling Gradient Method for Convex Optimization

Trang H. Tran, Lam Nguyen, et al.

INFORMS 2022

View all publications