{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T12:24:00Z","timestamp":1776687840185,"version":"3.51.2"},"reference-count":4,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1979,6,1]],"date-time":"1979-06-01T00:00:00Z","timestamp":297043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1979,6]]},"DOI":"10.1016\/0020-0190(79)90113-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"234-235","source":"Crossref","is-referenced-by-count":158,"title":["O(n2.7799) complexity for n \u00d7 n approximate matrix multiplication"],"prefix":"10.1016","volume":"8","author":[{"given":"Dario","family":"Bini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milvio","family":"Capovani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Romani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grazia","family":"Lotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90113-3_BIB1","series-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"Borodin","year":"1975"},{"key":"10.1016\/0020-0190(79)90113-3_BIB2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1137\/0202013","article-title":"Duality applied to the complexity of matrix multiplication and other bilinear forms","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(79)90113-3_BIB3","article-title":"Strassen algorithm is not optimal","author":"Ya. Pan","year":"1978","journal-title":"Proc. IEEE 19th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(79)90113-3_BIB4","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BF02165411","article-title":"Gaussian elimination is not optimal","volume":"13","author":"Strassen","year":"1969","journal-title":"Numer. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901133?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901133?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:29:17Z","timestamp":1555072157000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079901133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,6]]},"references-count":4,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1979,6]]}},"alternative-id":["0020019079901133"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90113-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,6]]}}}