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

Conference paper

Characterization of a next generation step-and-scan system

Timothy J. Wiltshire, Joseph P. Kirk, et al.

SPIE Advanced Lithography 1998

Conference paper

Motion video analysis using planar parallax

Harpreet S. Sawhney

IS&T/SPIE Electronic Imaging 1994

Paper

Irredundancy in circular arc graphs

Martin Charles Golumbic, Renu C. Laskar

Discrete Applied Mathematics

Paper

New omega results in a weighted divisor problem

James Lee Hafner

Journal of Number Theory

View all publications