{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:47:13Z","timestamp":1774630033268,"version":"3.50.1"},"reference-count":7,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1980,5,1]],"date-time":"1980-05-01T00:00:00Z","timestamp":325987200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1980,5,1]],"date-time":"1980-05-01T00:00:00Z","timestamp":325987200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1980,5,1]],"date-time":"1980-05-01T00:00:00Z","timestamp":325987200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1980,5]]},"DOI":"10.1109\/tc.1980.1675583","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"337-340","source":"Crossref","is-referenced-by-count":25,"title":["An Improved Lower Bound on Polynomial Multiplication"],"prefix":"10.1109","volume":"C-29","author":[{"family":"Brown","sequence":"first","affiliation":[{"name":"Department of Computer Science, Yale University"}]},{"family":"Dobkin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0202013"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(78)90012-5"},{"key":"ref6","author":"knuth","year":"1969","journal-title":"The Art of Computer Programming Vol 2 Seminumerical Algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref2","author":"borodin","year":"1975","journal-title":"The Computational Complexity of Algebraic and Numeric Problems"},{"key":"ref1","author":"berlekamp","year":"1968","journal-title":"Algebraic Coding Theory"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35193\/01675583.pdf?arnumber=1675583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T17:56:28Z","timestamp":1752774988000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1675583\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,5]]},"references-count":7,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tc.1980.1675583","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,5]]}}}