{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:56:38Z","timestamp":1787500598628,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540006237","type":"print"},{"value":"9783540364948","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36494-3_36","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T17:12:04Z","timestamp":1269882724000},"page":"403-414","source":"Crossref","is-referenced-by-count":4,"title":["Algebras of Minimal Rank over Arbitrary Fields"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"36_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":"36_CR2","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":"36_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/PL00001605","volume":"9","author":"M. Bl\u00e4ser","year":"2000","unstructured":"Markus Bl\u00e4ser. Lower bounds for the bilinear complexity of associative algebras. Comput. Complexity, 9:73\u2013112, 2000.","journal-title":"Comput. Complexity"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Markus Bl\u00e4ser. Algebras of minimal rank over perfect fields. In Proc. 17th Ann. IEEE Computational Complexity Conf. (CCC), pages 113\u2013122, 2002.","DOI":"10.1109\/CCC.2002.1004346"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0024-3795(85)90080-1","volume":"69","author":"W. B\u00fcchi","year":"1985","unstructured":"Werner B\u00fcchi and Michael Clausen. On a class of primary algebras of minimal rank. Lin. Alg. Appl., 69:249\u2013268, 1985.","journal-title":"Lin. Alg. Appl."},{"key":"36_CR6","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":"36_CR7","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":"36_CR8","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":"36_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0024-3795(83)90165-9","volume":"55","author":"H. F. Groote de","year":"1983","unstructured":"Hans F. de Groote and Joos Heintz. Commutative algebras of minimal rank. Lin. Alg. Appl., 55:37\u201368, 1983.","journal-title":"Lin. Alg. Appl."},{"key":"36_CR10","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"On associative algebras of minimal rank","author":"J. Heintz","year":"1986","unstructured":"Joos Heintz and Jacques Morgenstern. On associative algebras of minimal rank. In Proc. 2nd Applied Algebra and Error Correcting Codes Conf. (AAECC), Lecture Notes in Comput. Sci. 228, pages 1\u201324. Springer, 1986."},{"key":"36_CR11","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":"36_CR12","first-page":"634","volume-title":"Handbook of Theoretical Computer Science","author":"V. Strassen","year":"1990","unstructured":"Volker Strassen. Algebraic complexity theory. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science Vol. A, pages 634\u2013672. Elsevier Science Publishers B.V., 1990."},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0304-3975(79)90017-3","volume":"8","author":"S. Winograd","year":"1979","unstructured":"Shmuel Winograd. On multiplication in algebraic extension fields. Theoret. Comput. Sci., 8:359\u2013377, 1979.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","STACS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36494-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T03:53:23Z","timestamp":1550980403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36494-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006237","9783540364948"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-36494-3_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}