{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:40:38Z","timestamp":1787503238051,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540416951","type":"print"},{"value":"9783540446934","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44693-1_9","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T01:10:18Z","timestamp":1181610618000},"page":"99-109","source":"Crossref","is-referenced-by-count":10,"title":["A 5\/2n 2-Lower Bound for the Multiplicative Complexity of n \u00d7 n-Matrix Multiplication"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,3,16]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(81)90070-0","volume":"15","author":"A. Alder","year":"1981","unstructured":"A. Alder and V. Strassen. On the algorithmic complexity of associative algebras. Theoret. Comput. Sci., 15:201\u2013211, 1981.","journal-title":"Theoret. Comput. Sci"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/0020-0190(79)90113-3","volume":"8","author":"D. Bini","year":"1979","unstructured":"Dario Bini, Milvio Capovani, Grazia Lotti, and Francesco Romani. O(n 2:7799) complexity for matrix multiplication. Inf. Proc. Letters, 8:234\u2013235, 1979.","journal-title":"Inf. Proc. Letters"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Markus Bl\u00e4ser. A 5\/2n 2lower bound for the rank of nxnmatrix multiplication over arbitrary fields. In Proc. 40th Ann. IEEE Symp. on Found. Comput. Sci. (FOCS), pages 45\u201350, 1999.","DOI":"10.1109\/SFFCS.1999.814576"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s000370050028","volume":"8","author":"M. Bl\u00e4ser","year":"1999","unstructured":"Markus Bl\u00e4ser. Lower bounds for the multiplicative complexity of matrix multiplication. Comput. Complexity, 8:203\u2013226, 1999.","journal-title":"Comput. Complexity"},{"key":"9_CR5","unstructured":"Markus Bl\u00e4ser. Untere Schranken f\u00fcr den Rang assoziativer Algebren. Dissertation, Universit\u00e4t Bonn, 1999."},{"key":"9_CR6","unstructured":"Markus Bl\u00e4ser. Lower bounds for the bilinear complexity of associative algebras. Comput. Complexity, to appear."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0024-3795(78)90012-5","volume":"19","author":"R. W. Brockett","year":"1978","unstructured":"Roger W. Brockett and David Dobkin. On the optimal evaluation of a set of bilinear forms. Lin. Alg. Appl., 19:207\u2013235, 1978.","journal-title":"Lin. Alg. Appl"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0218052","volume":"18","author":"N. H. Bshouty","year":"1989","unstructured":"Nader H. Bshouty. A lower bound for matrix multiplication. SIAM J. Comput., 18:759\u2013765, 1989.","journal-title":"SIAM J. Comput"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Peter B\u00fcrgisser, Michael Clausen, and M. Amin Shokrollahi. Algebraic Complexity Theory. Springer, 1997.","DOI":"10.1007\/978-3-662-03338-8"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progression. J. Symbolic Comput., 9:251\u2013280, 1990.","journal-title":"J. Symbolic Comput"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Yurij A. Drozd and Vladimir V. Kirichenko. Finite Dimensional Algebras. Springer, 1994.","DOI":"10.1007\/978-3-642-76244-4"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/0212007","volume":"12","author":"H. F. Groote de","year":"1983","unstructured":"Hans F. de Groote. Characterization of division algebras of minimal rank and the structure of their algorithm varieties. SIAM J. Comput., 12:101\u2013117, 1983.","journal-title":"SIAM J. Comput"},{"key":"9_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Lectures on the Complexity of Bilinear Problems","author":"H. F. Groote de","year":"1986","unstructured":"Hans F. de Groote. Lectures on the Complexity of Bilinear Problems. LNCS 245. Springer, 1986."},{"key":"9_CR14","first-page":"717","volume":"9","author":"J. Ja\u2019Ja\u2019","year":"1980","unstructured":"Joseph Ja\u2019Ja\u2019. On the complexity of bilinear forms with commutativity. SIAM J. Comput., 9:717\u2013738, 1980.","journal-title":"SIAM J. Comput"},{"key":"9_CR15","series-title":"Technical report","volume-title":"A lower bound for the multiplicative complexity of the product of two matrices","author":"L. Jean-Claude","year":"1978","unstructured":"Jean-Claude Lafon and Shmuel Winograd. A lower bound for the multiplicative complexity of the product of two matrices. Technical report, Centre de Calcul de L\u2019Esplanade, U.E.R. de Mathematique, Univ. Louis Pasteur, Strasbourg, France, 1978."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1070\/RM1966v021n01ABEH004147","volume":"21","author":"V. Yu. Pan","year":"1966","unstructured":"Victor Yu. Pan. Methods for computing values of polynomials. Russ. Math. Surv., 21:105\u2013136, 1966.","journal-title":"Russ. Math. Surv"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Richard S. Pierce. Associative Algebras. Springer, 1982.","DOI":"10.1007\/978-1-4757-0163-0"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/0210032","volume":"10","author":"A. Sch\u00f6nhage","year":"1981","unstructured":"Arnold Sch\u00f6nhage. Partial and total matrix multiplication. SIAM J. Comput., 10:434\u2013455, 1981.","journal-title":"SIAM J. Comput"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Volker Strassen. Gaussian elimination is not optimal. Num. Math., 13:354\u2013356, 1969.","journal-title":"Num. Math"},{"key":"9_CR20","first-page":"184","volume":"264","author":"V. Strassen","year":"1973","unstructured":"Volker Strassen. Vermeidung von Divisionen. J. Reine Angew. Math., 264:184\u2013202, 1973.","journal-title":"J. Reine Angew. Math"},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/0024-3795(83)80041-X","volume":"52\/53","author":"Volker Strassen","year":"1983","unstructured":"Volker Strassen. Rank and optimal computation of generic tensors. Lin. Alg. Appl., 52\/53:645\u2013685, 1983.","journal-title":"Lin. Alg. Appl."},{"issue":"376","key":"9_CR22","first-page":"406","volume":"375\/","author":"V. Strassen","year":"1987","unstructured":"Volker Strassen. Relative bilinear complexity and matrix multiplication. J. Reine Angew. Math., 375\/376:406\u2013443, 1987.","journal-title":"J. Reine Angew. Math"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Volker Strassen. Algebraic complexity theory. In J. van Leeuven, editor, Handbook of Theoretical Computer Science Vol. A, pages 634\u2013672. Elsevier Science Publishers B.V., 1990.","DOI":"10.1016\/B978-0-444-88071-0.50016-3"}],"container-title":["Lecture Notes in Computer Science","STACS 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44693-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T00:57:01Z","timestamp":1737075421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44693-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416951","9783540446934"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-44693-1_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}