1990 MatrixMultiplicationviaArithmet

• (Coppersmith & Winograd, 1990) ⇒ Don Coppersmith, and Shmuel Winograd. (1990). “Matrix Multiplication via Arithmetic Progressions.” In: Journal of Symbolic Computation, 9(3). doi:10.1016/S0747-7171(08)80013-2

Subject Headings: Coppersmith–Winograd Algorithm.

Notes

• a follow-up paper to (Coppersmith & Winograd, 1997) ⇒ Don Coppersmith, and Shmuel Winograd. (1987). “Matrix multiplication via arithmetic progressions.” In: Proceedings of the nineteenth annual ACM symposium on Theory of computing, pp. 1-6. ACM, 1987.

Cited By

• http://scholar.google.com/scholar?q=%221990%22+Matrix+Multiplication+via+Arithmetic+Progressions
• http://dl.acm.org/citation.cfm?id=77763.77766&preflayout=flat#citedby

Quotes

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.

References

;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
1990 MatrixMultiplicationviaArithmet	Don Coppersmith Shmuel Winograd			Matrix Multiplication via Arithmetic Progressions				10.1016/S0747-7171(08)80013-2		1990