Given by Don Coppersmith and Shmuel Winograd in 1990 as 'Matrix multiplication via arithmetic progressions' in the Journal of Symbolic Computation 9(3).
Its conceptual idea is similar to Strassen's: a way is devised for multiplying two k×k matrices with fewer scalar multiplications than the standard count.
Every recent record algorithm, including the O(n^2.371339) bound of 2025, is a generalization of the Coppersmith–Winograd algorithm.