{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:13:12Z","timestamp":1648771992270},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1016\/0196-6774(88)90010-7","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"137-147","source":"Crossref","is-referenced-by-count":3,"title":["An algorithm for polynomial multiplication that does not depend on the ring constants"],"prefix":"10.1016","volume":"9","author":[{"given":"Michael","family":"Kaminski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(88)90010-7_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0196-6774(88)90010-7_BIB2","first-page":"457","article-title":"Resultants of cyclotomic polynomials","volume":"24","author":"Apostol","year":"1970"},{"key":"10.1016\/0196-6774(88)90010-7_BIB3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.4064\/aa-21-1-329-345","article-title":"The distribution of values of the Euler function","volume":"21","author":"Bateman","year":"1972","journal-title":"Acta Arith."},{"key":"10.1016\/0196-6774(88)90010-7_BIB4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TC.1980.1675583","article-title":"An improved lower bound on polynomial multiplication","volume":"29","author":"Brown","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0196-6774(88)90010-7_BIB5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1145\/322003.322014","article-title":"Algebras having linear multiplicative complexities","volume":"24","author":"Fiduccia","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(88)90010-7_BIB6","series-title":"Proceedings, 1981 ACM Symposium on Algebraic and Symbolic Computation","first-page":"117","article-title":"Note on probabilistic algorithms in integer and polynomial arithmetic","author":"Kaminski","year":"1981"},{"key":"10.1016\/0196-6774(88)90010-7_BIB7","series-title":"Proceedings, 25th IEEE Sympos. on Foundations of Computer Science","first-page":"251","article-title":"Multiplication of polynomials over the ring of integers","author":"Kaminski","year":"1984"},{"key":"10.1016\/0196-6774(88)90010-7_BIB8","doi-asserted-by":"crossref","unstructured":"M. Kaminski, Cyclotomic polynomials and units in cyclotomic number fields, J. Number Theory, to appear.","DOI":"10.1016\/0022-314X(88)90043-1"},{"key":"10.1016\/0196-6774(88)90010-7_BIB9","first-page":"293","article-title":"Multiplication of multidigit numbers on automata","volume":"145","author":"Karutsuba","year":"1962","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0196-6774(88)90010-7_BIB10","series-title":"Algebra","author":"Lang","year":"1965"},{"key":"10.1016\/0196-6774(88)90010-7_BIB11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0304-3975(83)90108-1","article-title":"On the complexity of multiplication in finite fields","volume":"22","author":"Lempel","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0196-6774(88)90010-7_BIB12","series-title":"The Theory of Error Correcting Codes","author":"McWilliams","year":"1977"},{"key":"10.1016\/0196-6774(88)90010-7_BIB13","series-title":"Proceedings, 13th Annu. Sympos. on Switching and Automata Theory","first-page":"90","article-title":"Fast modular transforms via divisions","author":"Moenck","year":"1972"},{"key":"10.1016\/0196-6774(88)90010-7_BIB14","series-title":"An Introduction to the Theory of Numbers","author":"Niven","year":"1960"},{"key":"10.1016\/0196-6774(88)90010-7_BIB15","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1109\/TASSP.1980.1163372","article-title":"Fast polynomial transform algorithms for digital convolution","volume":"28","author":"Nussbaumer","year":"1980","journal-title":"IEEE Trans. Acoustics Speech Signal Process."},{"key":"10.1016\/0196-6774(88)90010-7_BIB16","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00289470","article-title":"Schnelle Multiplikation von Polynomen \u00fcber K\u00f6rpern der Charakteristik 2","volume":"7","author":"Sch\u00f6nhage","year":"1977","journal-title":"Acta Inform."},{"key":"10.1016\/0196-6774(88)90010-7_BIB17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01683270","article-title":"Some bilinear forms whose multiplicative complexity depends on the field constants","volume":"10","author":"Winograd","year":"1976","journal-title":"Math. System Theory"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677488900107?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677488900107?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:24:24Z","timestamp":1548725064000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677488900107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["0196677488900107"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(88)90010-7","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}