{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:32:01Z","timestamp":1772519521941,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0885-064x(02)00007-9","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T12:32:20Z","timestamp":1043929940000},"page":"43-60","source":"Crossref","is-referenced-by-count":46,"title":["On the complexity of the multiplication of matrices of small formats"],"prefix":"10.1016","volume":"19","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0885-064X(02)00007-9_BIB1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(81)90070-0","article-title":"On the algorithmic complexity of associative algebras","volume":"15","author":"Alder","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0885-064X(02)00007-9_BIB2","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/0020-0190(79)90113-3","article-title":"O(n2.7799) complexity for matrix multiplication","volume":"8","author":"Bini","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0885-064X(02)00007-9_BIB3","unstructured":"M. Bl\u00e4ser, A 52 n2-lower bound for the rank of n\u00d7n-matrix multiplication over arbitrary fields, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1999, pp. 45\u201350."},{"key":"10.1016\/S0885-064X(02)00007-9_BIB4","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s000370050028","article-title":"Lower bounds for the multiplicative complexity of matrix multiplication","volume":"8","author":"Bl\u00e4ser","year":"1999","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0885-064X(02)00007-9_BIB5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/PL00001605","article-title":"Lower bounds for the bilinear complexity of associative algebras","volume":"9","author":"Bl\u00e4ser","year":"2000","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0885-064X(02)00007-9_BIB6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0024-3795(78)90012-5","article-title":"On the optimal evaluation of a set of bilinear forms","volume":"19","author":"Brockett","year":"1978","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0885-064X(02)00007-9_BIB7","series-title":"Algebraic Complexity Theory","author":"B\u00fcrgisser","year":"1997"},{"key":"10.1016\/S0885-064X(02)00007-9_BIB8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetic progression","volume":"9","author":"Coppersmith","year":"1990","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0885-064X(02)00007-9_BIB9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(78)90045-2","article-title":"On the varieties of optimal algorithms for the computation of bilinear mappings","volume":"7","author":"de Groote","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0885-064X(02)00007-9_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(78)90038-5","article-title":"On the varieties of optimal algorithms for the computation of bilinear mappings","volume":"7","author":"de Groote","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0885-064X(02)00007-9_BIB11","doi-asserted-by":"crossref","unstructured":"H.F. de Groote, Lectures on the Complexity of Bilinear Problems, Lecture Notes in Computer Science, Vol. 245, Springer, Berlin, 1986.","DOI":"10.1007\/BFb0020719"},{"key":"10.1016\/S0885-064X(02)00007-9_BIB12","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1137\/0120004","article-title":"On minimizing the number of multiplications necessary for matrix multiplication","volume":"20","author":"Hopcroft","year":"1971","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"10.1016\/S0885-064X(02)00007-9_BIB13","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1137\/0215043","article-title":"Noncommutative bilinear algorithms for 3\u00d73 matrix multiplication","volume":"15","author":"Johnson","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0885-064X(02)00007-9_BIB14","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1090\/S0002-9904-1976-13988-2","article-title":"A noncommutative algorithm for multiplying 3\u00d73-matrices using 23 multiplications","volume":"82","author":"Laderman","year":"1976","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0885-064X(02)00007-9_BIB15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1070\/RM1966v021n01ABEH004147","article-title":"Methods for computing values of polynomials","volume":"21","author":"Pan","year":"1966","journal-title":"Russian Math. Surveys"},{"key":"10.1016\/S0885-064X(02)00007-9_BIB16","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1137\/0210032","article-title":"Partial and total matrix multiplication","volume":"10","author":"Sch\u00f6nhage","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0885-064X(02)00007-9_BIB17","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","article-title":"Gaussian elimination is not optimal","volume":"13","author":"Strassen","year":"1969","journal-title":"Numer. Math."},{"key":"10.1016\/S0885-064X(02)00007-9_BIB18","first-page":"406","article-title":"Relative bilinear complexity and matrix multiplication","volume":"375\/376","author":"Strassen","year":"1987","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/S0885-064X(02)00007-9_BIB19","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/T-C.1970.222926","article-title":"On Winograd's algorithm for inner products","volume":"C-19","author":"Waksman","year":"1970","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0885-064X(02)00007-9_BIB20","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0024-3795(71)90009-7","article-title":"On multiplication of 2\u00d72-matrices","volume":"4","author":"Winograd","year":"1971","journal-title":"Linear Algebra Appl."}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X02000079?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X02000079?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T22:39:27Z","timestamp":1583966367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0885064X02000079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0885064X02000079"],"URL":"https:\/\/doi.org\/10.1016\/s0885-064x(02)00007-9","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}