AWhat changed
Coppersmith and Winograd combined trilinear tensor constructions with progression-free hashing and pruning to obtain an asymptotic matrix-multiplication exponent below2.376, extending earlier Strassen and Schönhage machinery.
Scientific scope
Coppersmith and Winograd combined trilinear tensor constructions with progression-free hashing and pruning to obtain an asymptotic matrix-multiplication exponent below2.376, extending earlier Strassen and Schönhage machinery. The result is an asymptotic bound on matrix multiplication in its field-arithmetic model, using inherited tensor and progression-free-set tools. It is not a measured practical runtime or a proof that the exponent equals two. The paper explicitly describes practicality limits, and its exponent-two discussion is conditional. Later improvements and implementations receive separate credit.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Don Coppersmith · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Shmuel Winograd · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- D. Coppersmith and S. Winograd, Matrix Multiplication via Arithmetic Progressions (1990) — complete journal article
- IBM Research publication identity: Matrix multiplication via arithmetic progressions
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction