Local Search for Fast Matrix Multiplication
- 525 Downloads
Laderman discovered a scheme for computing the product of two \(3\times 3\) matrices using only 23 multiplications in 1976. Since then, some more such schemes were proposed, but nobody knows how many such schemes there are and whether there exist schemes with fewer than 23 multiplications. In this paper we present two independent SAT-based methods for finding new schemes using 23 multiplications. Both methods allow computing a few hundred new schemes individually, and many thousands when combined. Local search SAT solvers outperform CDCL solvers consistently in this application.
The authors acknowledge the Texas Advanced Computing Center at The University of Texas at Austin for providing HPC resources that have contributed to the research results reported within this paper.
- 1.Biere, A.: CaDiCaL, Lingeling, Plingeling, Treengeling and YalSAT entering the SAT competition 2018. In: Proceedings of the SAT Competition 2018 – Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2018-1, pp. 13–14. University of Helsinki (2018)Google Scholar
- 3.Bläser, M.: Fast Matrix Multiplication. Number 5 in Graduate Surveys. Theory of Computing Library (2013)Google Scholar
- 4.Brent, R.P.: Algorithms for matrix multiplication. Technical report, Department of Computer Science, Stanford (1970)Google Scholar
- 5.Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory, vol. 315. Springer, Heidelberg (2013)Google Scholar
- 6.Courtois, N., Bard, G.V., Hulme, D.: A new general-purpose method to multiply \(3\times 3\) matrices using only 23 multiplications. CoRR, abs/1108.2830 (2011)Google Scholar
- 9.Heule, M.J.H., Kauers, M., Seidl, M.: New ways to multiply \(3\times 3\) matrices (in preparation)Google Scholar
- 13.Pan, V.Y.: Fast feasible and unfeasible matrix multiplication. CoRR, abs/1804.04102 (2018)Google Scholar