{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T10:41:18Z","timestamp":1777372878846,"version":"3.51.4"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":[[1986,1]]},"DOI":"10.1016\/0020-0190(86)90035-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"11-14","source":"Crossref","is-referenced-by-count":8,"title":["The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms"],"prefix":"10.1016","volume":"22","author":[{"given":"Victor Ya.","family":"Pan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90035-9_BIB1","series-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"Borodin","year":"1975"},{"issue":"3","key":"10.1016\/0020-0190(86)90035-9_BIB2","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."},{"issue":"2","key":"10.1016\/0020-0190(86)90035-9_BIB3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1137\/0208009","article-title":"Lower bounds on synchronous combinatorial complexity","volume":"9","author":"Harper","year":"1979","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0020-0190(86)90035-9_BIB4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1145\/321752.321761","article-title":"A note on a lower bound of the linear complexity of the fast Fourier transform","volume":"20","author":"Morgenstern","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(86)90035-9_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(83)90031-7","article-title":"The additive and logical complexity of linear and bilinear algorithms","volume":"4","author":"Pan","year":"1983","journal-title":"J. Algorithms"},{"issue":"3","key":"10.1016\/0020-0190(86)90035-9_BIB6","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/S0022-0000(76)80041-4","article-title":"Graph-theoretic properties in computational complexity","volume":"13","author":"Valiant","year":"1976","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/0020-0190(86)90035-9_BIB7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0001-8708(79)90037-9","article-title":"On the multiplicative complexity of the discrete Fourier transform","volume":"32","author":"Winograd","year":"1979","journal-title":"Adv. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900359?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900359?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:28:49Z","timestamp":1553592529000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["0020019086900359"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90035-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}