{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:05Z","timestamp":1725488945252},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_59","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"669-680","source":"Crossref","is-referenced-by-count":0,"title":["Semisimple Algebras of Almost Minimal Rank over the Reals"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Meyer de Voltaire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"59_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(81)90070-0","volume":"15","author":"A. Alder","year":"1981","unstructured":"Alder, A., Strassen, V.: On the algorithmic complexity of associative algebras. Theoret. Comput. Sci.\u00a015, 201\u2013211 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"59_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/PL00001605","volume":"9","author":"M. Bl\u00e4ser","year":"2000","unstructured":"Bl\u00e4ser, M.: Lower bounds for the bilinear complexity of associative algebras. Comput. Complexity\u00a09, 73\u2013112 (2000)","journal-title":"Comput. Complexity"},{"key":"59_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0885-064X(02)00007-9","volume":"19","author":"M. Bl\u00e4ser","year":"2003","unstructured":"Bl\u00e4ser, M.: On the complexity of the multiplication of matrices of small formats. J. Complexity\u00a019, 43\u201360 (2003)","journal-title":"J. Complexity"},{"issue":"2","key":"59_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/S0097539703438277","volume":"34","author":"M. Bl\u00e4ser","year":"2004","unstructured":"Bl\u00e4ser, M.: A complete characterization of the algebras of minimal bilinear complexity. SIAM J. Comput.\u00a034(2), 277\u2013298 (2004)","journal-title":"SIAM J. Comput."},{"key":"59_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":"B\u00fcchi, W., Clausen, M.: On a class of primary algebras of minimal rank. Lin. Alg. Appl.\u00a069, 249\u2013268 (1985)","journal-title":"Lin. Alg. Appl."},{"key":"59_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.: Algebraic Complexity Theory. Springer, Heidelberg (1997)"},{"key":"59_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/0212007","volume":"12","author":"H.F. Groote de","year":"1983","unstructured":"de Groote, H.F.: Characterization of division algebras of minimal rank and the structure of their algorithm varieties. SIAM J. Comput.\u00a012, 101\u2013117 (1983)","journal-title":"SIAM J. Comput."},{"key":"59_CR8","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":"de Groote, H.F., Heintz, J.: Commutative algebras of minimal rank. Lin. Alg. Appl.\u00a055, 37\u201368 (1983)","journal-title":"Lin. Alg. Appl."},{"key":"59_CR9","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Applied Algebra, Algorithmics and Error-Correcting Codes","author":"J. Heintz","year":"1986","unstructured":"Heintz, J., Morgenstern, J.: On associative algebras of minimal rank. In: Poli, A. (ed.) Applied Algebra, Algorithmics and Error-Correcting Codes. LNCS, vol.\u00a0228, pp. 1\u201324. Springer, Heidelberg (1986)"},{"key":"59_CR10","first-page":"634","volume-title":"Handbook of Theoretical Computer Science","author":"V. Strassen","year":"1990","unstructured":"Strassen, V.: Algebraic complexity theory. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0A, pp. 634\u2013672. Elsevier Science Publishers B.V, Amsterdam (1990)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:30Z","timestamp":1619519370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}