{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T12:26:04Z","timestamp":1648556764539},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0304-3975(83)90068-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"135-150","source":"Crossref","is-referenced-by-count":6,"title":["On commutativity and approximation"],"prefix":"10.1016","volume":"28","author":[{"given":"Dario","family":"Bini","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90068-3_BIB1","article-title":"Border rank","author":"Alder","year":"1981","journal-title":"5th Oberwolfach Conf. on Complexity Theory"},{"key":"10.1016\/0304-3975(83)90068-3_BIB2","first-page":"98","article-title":"Border rank of a p\u00d7q\u00d72 tensor and the optimal approximation of a pair of bilinear forms","volume":"85","author":"Bini","year":"1980"},{"key":"10.1016\/0304-3975(83)90068-3_BIB3","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/0020-0190(79)90113-3","article-title":"O(n2.7799) complexity for n \u00d7 n approximate matrix multiplication","volume":"8","author":"Bini","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(83)90068-3_BIB4","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0209053","article-title":"Approximate solutions for the bilinear forms computational problem","volume":"9","author":"Bini","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90068-3_BIB5","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/0211038","article-title":"On the asymptotic complexity of matrix multiplication","volume":"11","author":"Coppersmith","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90068-3_BIB6","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/0209056","article-title":"On the complexity of bilinear forms with commutativity","volume":"9","author":"Ja' Ja'","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90068-3_BIB7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0024-3795(77)90069-6","article-title":"Three-way array: Rank and uniqueness of trilinear decompositions with application to arithmetic complexity and statistics","volume":"18","author":"Kruskal","year":"1977","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0304-3975(83)90068-3_BIB8","first-page":"28","article-title":"Field extension and trilinear aggregating uniting and cancelling for the acceleration of matrix multiplication","volume":"20","author":"Pan","year":"1979","journal-title":"Proc. Symp. on Foundations of Comput. Sci."},{"key":"10.1016\/0304-3975(83)90068-3_BIB9","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\/0304-3975(83)90068-3_BIB10","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0203010","article-title":"Polynomials with rational coefficient which are hard to compute","volume":"3","author":"Strassen","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90068-3_BIB11","first-page":"184","article-title":"Vermeiding von divisionen","volume":"246","author":"Strassen","year":"1975","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/0304-3975(83)90068-3_BIB12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0024-3795(78)90005-8","article-title":"Some elementary proofs of lower bounds in complexity theory","volume":"19","author":"Van Leeuwen","year":"1978","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0304-3975(83)90068-3_BIB13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/cpa.3160230204","article-title":"On the number of multiplications necessary to compute certain functions","volume":"23","author":"Winograd","year":"1970","journal-title":"Comm. Pure Appl. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900683?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900683?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:50:11Z","timestamp":1555127411000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900683"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583900683"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90068-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}