Arrow Research search
Back to STOC

STOC 1987

Matrix Multiplication via Arithmetic Progressions

Conference Paper Accepted Paper Algorithms and Complexity ยท Theoretical Computer Science

Abstract

We present a new method for accelerating matrix multiplication asymptotically. This work builds on recent ideas of Volker Strassen, by using a basic trilinear form which is not a matrix product. We make novel use of the Salem-Spencer Theorem, which gives a fairly dense set of integers with no three-term arithmetic progression. Our resulting matrix exponent is 2.376.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
632883924284049693
v2026.09.13