{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:12:03Z","timestamp":1774797123422,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/0304-3975(81)90070-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"201-211","source":"Crossref","is-referenced-by-count":67,"title":["On the algorithmic complexity of associative algebras"],"prefix":"10.1016","volume":"15","author":[{"given":"A.","family":"Alder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Strassen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(81)90070-0_BIB1","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":"Information Processing Lett."},{"key":"10.1016\/0304-3975(81)90070-0_BIB2","series-title":"Nota interna B79\/8","article-title":"Relations between EC-algorithms and APA-algorithms, applications","author":"Bini","year":"1979"},{"key":"10.1016\/0304-3975(81)90070-0_BIB3","series-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"Borodin","year":"1975"},{"key":"10.1016\/0304-3975(81)90070-0_BIB4","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 and Appl."},{"key":"10.1016\/0304-3975(81)90070-0_BIB5","series-title":"Thesis","article-title":"On the arithmetic complexity of a class of arithmetic computations","author":"Dobkin","year":"1973"},{"key":"10.1016\/0304-3975(81)90070-0_BIB6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1145\/322003.322014","article-title":"Algebras having linear multiplicative complexity","volume":"24","author":"Fiduccia","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(81)90070-0_BIB7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(78)90045-2","article-title":"On varieties of optimal algorithms for the computation of bilinear mappings II. Optimal algorithms for 2\u00d72-matrix multiplication","volume":"7","author":"de Groote","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(81)90070-0_BIB8","doi-asserted-by":"crossref","first-page":"30","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."},{"key":"10.1016\/0304-3975(81)90070-0_BIB9","first-page":"75","article-title":"The complexity of the quaternion product","author":"Howell","year":"1975","journal-title":"Cornell University TR"},{"key":"10.1016\/0304-3975(81)90070-0_BIB10","unstructured":"J.C. Lafon and S. Winograd, to appear."},{"key":"10.1016\/0304-3975(81)90070-0_BIB11","series-title":"Studies Presented to R. von Mises","first-page":"40","article-title":"On two problems in abstract algebra connected with Horner's rule","author":"Ostrowski","year":"1954"},{"key":"10.1016\/0304-3975(81)90070-0_BIB12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1070\/RM1966v021n01ABEH004147","article-title":"Methods of computing values of polynomials","volume":"21","author":"Pan","year":"1966","journal-title":"Russian Math. Surveys"},{"key":"10.1016\/0304-3975(81)90070-0_BIB13","first-page":"166","article-title":"Strassen's algorithm is not optimal","author":"Pan","year":"1978","journal-title":"Proc. 19th Annual Symposium on Foundations of Computer Science"},{"issue":"2","key":"10.1016\/0304-3975(81)90070-0_BIB14","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1137\/0209027","article-title":"New fast algorithms for matrix operations","volume":"9","author":"Pan","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(81)90070-0_BIB15","first-page":"28","article-title":"Field extension and trilinear aggregating, uniting and cancelling for the acceleration of matrix multiplication","author":"Pan","year":"1979","journal-title":"Proc. 20th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(81)90070-0_BIB16","series-title":"New combination of methods for the acceleration of matrix multiplication","author":"Pan","year":"1980"},{"key":"10.1016\/0304-3975(81)90070-0_BIB17","series-title":"Partial and total matrix multiplication","author":"Sch\u00f6nhage","year":"1979"},{"key":"10.1016\/0304-3975(81)90070-0_BIB18","doi-asserted-by":"crossref","unstructured":"A. Sch\u00f6nhage, Partial and total matrix multiplication, SIAM J. Comput., to appear.","DOI":"10.1137\/0210032"},{"key":"10.1016\/0304-3975(81)90070-0_BIB19","unstructured":"H.J. Stoss, Private communication (1979)."},{"key":"10.1016\/0304-3975(81)90070-0_BIB20","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\/0304-3975(81)90070-0_BIB21","first-page":"184","article-title":"Vermeidung von Divisionen","volume":"264","author":"Strassen","year":"1973","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/0304-3975(81)90070-0_BIB22","series-title":"Algebra Vol. 2","author":"van der Waerden","year":"1970"},{"key":"10.1016\/0304-3975(81)90070-0_BIB23","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 and Appl."},{"key":"10.1016\/0304-3975(81)90070-0_BIB24","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01683270","article-title":"Some bilinear forms whose multiplicative complexity depends on the field of constants","volume":"10","author":"Winograd","year":"1977","journal-title":"Math. Systems Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397581900700?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397581900700?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:25:37Z","timestamp":1555125937000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397581900700"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981]]}},"alternative-id":["0304397581900700"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(81)90070-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}