{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:04:21Z","timestamp":1775282661013,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":8539,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1016\/s0747-7171(08)80013-2","type":"journal-article","created":{"date-parts":[[2008,5,9]],"date-time":"2008-05-09T05:45:58Z","timestamp":1210311958000},"page":"251-280","source":"Crossref","is-referenced-by-count":1364,"title":["Matrix multiplication via arithmetic progressions"],"prefix":"10.1016","volume":"9","author":[{"given":"Don","family":"Coppersmith","sequence":"first","affiliation":[]},{"given":"Shmuel","family":"Winograd","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(08)80013-2_bib1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1073\/pnas.32.12.331","article-title":"On sets of integers which contain no three terms in arithmetical progression","volume":"32","author":"Behrend","year":"1946","journal-title":"Proc. Nat. Acad. Sci. USA"},{"issue":"No. 3","key":"10.1016\/S0747-7171(08)80013-2_bib2","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/0211038","article-title":"On the Asymptotic Complexity of Matrix Multiplication","volume":"Vol. 11","author":"Coppersmith","year":"1982","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0747-7171(08)80013-2_bib3","article-title":"Matrix Multiplication via Behrend's Theorem","author":"Coppersmith","year":"1986"},{"key":"10.1016\/S0747-7171(08)80013-2_bib4","series-title":"Proc. 19th Ann. ACM Symp. on theory of Computing","first-page":"1","article-title":"Matrix Multiplication via Arithmetic Progressions","author":"Coppersmith","year":"1987"},{"key":"10.1016\/S0747-7171(08)80013-2_bib5","series-title":"Proc. 19th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"166","article-title":"Strassen Algorithm Is Not Optimal. Trilinear Technique of Aggregating Uniting and Canceling for Constructing Fast Algorithms for Matrix Multiplication","author":"Pan","year":"1978"},{"key":"10.1016\/S0747-7171(08)80013-2_bib6","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-13866-8","article-title":"How to Multiply Matrices Faster","volume":"vol. 179","author":"Pan","year":"1984","journal-title":"Springer Lecture Notes in Computer Science"},{"issue":"3","key":"10.1016\/S0747-7171(08)80013-2_bib7","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. on Computing"},{"key":"10.1016\/S0747-7171(08)80013-2_bib8","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1073\/pnas.28.12.561","article-title":"On sets of integers which contain no three terms in arithmetical progression","volume":"28","author":"Salem","year":"1942","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"10.1016\/S0747-7171(08)80013-2_bib9","series-title":"Proc. 27th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"49","article-title":"The Asymptotic Spectrum of Tensors and the Exponent of Matrix Multiplication","author":"Strassen","year":"1986"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108800132?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108800132?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T17:59:01Z","timestamp":1546019941000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717108800132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["S0747717108800132"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(08)80013-2","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}