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)
2. Bläser, M.: On the complexity of the multiplication of matrices of small formats. J. Complex. 19(1), 43–60 (2003)
3. Bläser, M.: Fast Matrix Multiplication. Number 5 in Graduate Surveys. Theory of Computing Library (2013)
4. Brent, R.P.: Algorithms for matrix multiplication. Technical report, Department of Computer Science, Stanford (1970)
5. Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory, vol. 315. Springer, Heidelberg (2013)