Abstract
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.
M. J. H. Heule is supported by NSF grant CCF-1813993 and AFRL Award FA8750-15-2-0096.
M. Kauers is supported by the Austrian FWF grants P31571-N32 and F5004.
M. Seidl is supported by the Austrian FWF grant NFN S11408-N23 and the LIT AI Lab funded by the State of Upper Austria.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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)
Bläser, M.: On the complexity of the multiplication of matrices of small formats. J. Complex. 19(1), 43–60 (2003)
Bläser, M.: Fast Matrix Multiplication. Number 5 in Graduate Surveys. Theory of Computing Library (2013)
Brent, R.P.: Algorithms for matrix multiplication. Technical report, Department of Computer Science, Stanford (1970)
Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory, vol. 315. Springer, Heidelberg (2013)
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)
de Groote, H.F.: On varieties of optimal algorithms for the computation of bilinear mappings I. The isotropy group of a bilinear mapping. Theor. Comput. Sci. 7(1), 1–24 (1978)
Gomes, C., Sellmann, M.: Streamlined constraint reasoning. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 274–289. Springer, Heidelberg (2004)
Heule, M.J.H., Kauers, M., Seidl, M.: New ways to multiply \(3\times 3\) matrices (in preparation)
Laderman, J.D.: A noncommutative algorithm for multiplying \(3\times 3\) matrices using 23 multiplications. Bull. Am. Math. Soc. 82(1), 126–128 (1976)
Landsberg, J.M.: Geometry and Complexity Theory, vol. 169. Cambridge University Press, Cambridge (2017)
Oh, J., Kim, J., Moon, B.-R.: On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication. Inf. Process. Lett. 113(17), 640–645 (2013)
Pan, V.Y.: Fast feasible and unfeasible matrix multiplication. CoRR, abs/1804.04102 (2018)
Smirnov, A.V.: The bilinear complexity and practical algorithms for matrix multiplication. Comput. Math. Math. Phys. 53(12), 1781–1795 (2013)
Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13(4), 354–356 (1969)
Winograd, S.: On multiplication of \(2\times 2\) matrices. Linear Algebra Appl. 4(4), 381–388 (1971)
Acknowledgments
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Heule, M.J.H., Kauers, M., Seidl, M. (2019). Local Search for Fast Matrix Multiplication. In: Janota, M., Lynce, I. (eds) Theory and Applications of Satisfiability Testing – SAT 2019. SAT 2019. Lecture Notes in Computer Science(), vol 11628. Springer, Cham. https://doi.org/10.1007/978-3-030-24258-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-24258-9_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-24257-2
Online ISBN: 978-3-030-24258-9
eBook Packages: Computer ScienceComputer Science (R0)