{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T09:32:32Z","timestamp":1673429552666},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"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":[[1991,4]]},"DOI":"10.1016\/s0747-7171(08)80108-3","type":"journal-article","created":{"date-parts":[[2008,6,25]],"date-time":"2008-06-25T09:59:32Z","timestamp":1214387972000},"page":"307-320","source":"Crossref","is-referenced-by-count":8,"title":["Parallel multiplication and powering of polynomials"],"prefix":"10.1016","volume":"11","author":[{"given":"Carl G.","family":"Ponder","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(08)80108-3_bib1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"issue":"1","key":"10.1016\/S0747-7171(08)80108-3_bib2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/23002.27646","article-title":"A fast, low-space algorithm for multiplying dense multivariate polynomials","volume":"13","author":"Alagar","year":"1987","journal-title":"ACM TOMS"},{"key":"10.1016\/S0747-7171(08)80108-3_bib3","first-page":"301","article-title":"A deterministic algorithm for sparse multivariate polynomial interpolation","volume":"88","author":"Ben-Or","year":"1988","journal-title":"STOC"},{"key":"10.1016\/S0747-7171(08)80108-3_bib4","series-title":"Ph.D. thesis","article-title":"Polynomial Operations using the Fast Fourier Transform","author":"Bonneau","year":"1974"},{"key":"10.1016\/S0747-7171(08)80108-3_bib5","series-title":"Multidimensional Systems Theory","first-page":"184","article-title":"Gr\u00f6bner bases: an algorithmic method in polynomial ideal theory","author":"Buchberger","year":"1985"},{"key":"10.1016\/S0747-7171(08)80108-3_bib6","first-page":"511","article-title":"Parallel Merge Sort","volume":"86","author":"Cole","year":"1986"},{"issue":"3","key":"10.1016\/S0747-7171(08)80108-3_bib7","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0203016","article-title":"Polynomial multiplication, powers and asymptotic analysis: some comments","volume":"3","author":"Fateman","year":"1974","journal-title":"SIAM J. Comput"},{"issue":"2","key":"10.1016\/S0747-7171(08)80108-3_bib8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/sapm1974532145","article-title":"On the computation of powers of sparse polynomials","volume":"LIII","author":"Fateman","year":"1974","journal-title":"Studies in Applied Mathematics"},{"key":"10.1016\/S0747-7171(08)80108-3_bib9","series-title":"Proc. 1979 Macsyma Users Conference","first-page":"563","article-title":"Macsyma's general simplifier: philosophy and operation","author":"Fateman","year":"1979"},{"key":"10.1016\/S0747-7171(08)80108-3_bib10","series-title":"SYMSAC 76","first-page":"154","article-title":"Hashing lemmas on time complexities with applications to formula manipulation","author":"Goto","year":"1976"},{"issue":"6","key":"10.1016\/S0747-7171(08)80108-3_bib11","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/360825.360869","article-title":"Sorting X + Y","volume":"18","author":"Harper","year":"1975","journal-title":"CACM"},{"key":"10.1016\/S0747-7171(08)80108-3_bib12","series-title":"The Art of Computer Programming, Vol. 2: Semi-Numerical Algorithms","author":"Knuth","year":"1969"},{"key":"10.1016\/S0747-7171(08)80108-3_bib13","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/800206.806399","article-title":"Use of VLSI in algebraic computation: some suggestions","volume":"81","author":"Kung","year":"1981","journal-title":"SYMSAC"},{"key":"10.1016\/S0747-7171(08)80108-3_bib14","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1145\/800205.806332","article-title":"Practical fast polynomial multiplication","volume":"76","author":"Moenck","year":"1976","journal-title":"SYMSAC"},{"issue":"4","key":"10.1016\/S0747-7171(08)80108-3_bib15","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1137\/0208050","article-title":"A family of algorithms for powering sparse polynomials","volume":"8","author":"Probst","year":"1979","journal-title":"SIAM J. of Computing"},{"issue":"141","key":"10.1016\/S0747-7171(08)80108-3_bib16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1090\/S0025-5718-1978-0468306-4","article-title":"On computing the fast Fourier transform","volume":"32","author":"Winograd","year":"1978","journal-title":"Math. Comput."}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108801083?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108801083?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,27]],"date-time":"2018-12-27T16:58:00Z","timestamp":1545929880000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717108801083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["S0747717108801083"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(08)80108-3","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}