{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:00:08Z","timestamp":1776844808286,"version":"3.51.2"},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1974,6,1]],"date-time":"1974-06-01T00:00:00Z","timestamp":139276800000},"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":14291,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1974,6]]},"DOI":"10.1016\/s0022-0000(74)80029-2","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"366-386","source":"Crossref","is-referenced-by-count":54,"title":["Fast modular transforms"],"prefix":"10.1016","volume":"8","author":[{"given":"A.","family":"Borodin","sequence":"first","affiliation":[]},{"given":"R.","family":"Moenck","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No. 2","key":"10.1016\/S0022-0000(74)80029-2_bib1","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(71)90009-3","article-title":"Evaluating polynomials at many points","volume":"1","author":"Borodin","year":"1971","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0022-0000(74)80029-2_bib2","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1090\/S0002-9904-1939-07068-7","article-title":"On addition chains","volume":"45","author":"Brauer","year":"1939","journal-title":"Bull. Amer. Math. Soc."},{"issue":"No. 4","key":"10.1016\/S0022-0000(74)80029-2_bib3","doi-asserted-by":"crossref","DOI":"10.1145\/321662.321664","article-title":"On Euclid's algorithm and the computation of polynomial greatest common divisors","volume":"18","author":"Brown","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80029-2_bib4","series-title":"Proc. of the 2nd Symp. on Symbolic and Algebraic Manipulation","article-title":"Exact solution of linear equations","author":"Cabay","year":"1971"},{"issue":"No. 4","key":"10.1016\/S0022-0000(74)80029-2_bib5","doi-asserted-by":"crossref","DOI":"10.1145\/321662.321666","article-title":"The calculation of multivariate polynomial resultants","volume":"18","author":"Collins","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80029-2_bib6","series-title":"Proc. Third Annual ACM Symposium on Theory of Computation","first-page":"45","article-title":"Fast matrix multiplication","author":"Fiduccia","year":"1971"},{"key":"10.1016\/S0022-0000(74)80029-2_bib7","doi-asserted-by":"crossref","unstructured":"C. Fiduccia, Polynomial evaluation via the division algorithm: The fast Fourier transform revisited, Proc. 4th Symp. on Theory of Computing.","DOI":"10.1145\/800152.804900"},{"issue":"No. 1","key":"10.1016\/S0022-0000(74)80029-2_bib8","doi-asserted-by":"crossref","DOI":"10.1137\/0120004","article-title":"On minimizing the number of multiplications necessary for matrix multiplication","volume":"20","author":"Hopcroft","year":"1971","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0022-0000(74)80029-2_bib9","series-title":"Proc. of the 12th Symp. on Switching and Automata Theory","article-title":"On decreasing the computing time for modular algorithms","author":"Horowitz","year":"1971"},{"issue":"No. 4","key":"10.1016\/S0022-0000(74)80029-2_bib10","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(72)90050-6","article-title":"A fast method for interpolation of polynomials using preconditioning","volume":"1","author":"Horowitz","year":"1972","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0022-0000(74)80029-2_bib11","volume":"Vol. 2","author":"Knuth","year":"1969"},{"key":"10.1016\/S0022-0000(74)80029-2_bib12","series-title":"Proc. of the 2nd Symp. on Symbolic and Algebraic Manipulation","article-title":"Chinese remainder and interpolation algorithms","author":"Lipson","year":"1971"},{"key":"10.1016\/S0022-0000(74)80029-2_bib13","unstructured":"J. Lipson, private communication"},{"key":"10.1016\/S0022-0000(74)80029-2_bib14","series-title":"Proc. of the 13th Annual Symp. on Switching and Automata Theory","article-title":"Fast modular transforms via division","author":"Moenck","year":"1972"},{"key":"10.1016\/S0022-0000(74)80029-2_bib15","article-title":"Studies in fast algebraic algorithms","author":"Moenck","year":"1973"},{"issue":"No. 2","key":"10.1016\/S0022-0000(74)80029-2_bib16","doi-asserted-by":"crossref","DOI":"10.1145\/321752.321761","article-title":"Note on a lower bound of the linear complexity of the fast Fourier transform","volume":"20","author":"Morgenstern","year":"1973","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80029-2_bib17","series-title":"Studies Presented to R. von Mises","first-page":"40","article-title":"On Two Problems in Abstract Algebra Connected with Horner's Rule","author":"Ostrowski","year":"1954"},{"issue":"No. 1","key":"10.1016\/S0022-0000(74)80029-2_bib18","doi-asserted-by":"crossref","DOI":"10.1070\/RM1966v021n01ABEH004147","article-title":"Methods of computing values of polynomials","volume":"21","author":"Pan","year":"1966","journal-title":"Russian Math. Surveys"},{"issue":"No. 114","key":"10.1016\/S0022-0000(74)80029-2_bib19","doi-asserted-by":"crossref","DOI":"10.1090\/S0025-5718-1971-0301966-0","article-title":"The fast Fourier transform in a finite field","volume":"25","author":"Pollard","year":"1971","journal-title":"Math. Comp."},{"key":"10.1016\/S0022-0000(74)80029-2_bib20","first-page":"281","article-title":"Fast multiplication of large numbers","volume":"7","author":"Schoenhage","year":"1971","journal-title":"Computing"},{"issue":"No. 1","key":"10.1016\/S0022-0000(74)80029-2_bib21","article-title":"Schnelle Berechnung von Kettenbruchentwicklungen","volume":"1","author":"Schoenhage","year":"1971","journal-title":"Acta Informatica"},{"key":"10.1016\/S0022-0000(74)80029-2_bib22","series-title":"Proc. of the 13th Annual Symp. on Switching and Automata Theory","article-title":"On the number of multiplications for the evaluation of a polynomial and its derivatives","author":"Shaw","year":"1973"},{"issue":"No. 1-2","key":"10.1016\/S0022-0000(74)80029-2_bib23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF02242389","article-title":"An algorithm for division of power series","volume":"10","author":"Sieveking","year":"1972","journal-title":"Computing"},{"issue":"No. 3","key":"10.1016\/S0022-0000(74)80029-2_bib24","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01436566","article-title":"Die Berechnungskompl exit\u00e4t von elementarsymetrischen Funktionen und von Interpolationskoeffizienten","volume":"20","author":"Strassen","year":"1973","journal-title":"Numer. Math."},{"key":"10.1016\/S0022-0000(74)80029-2_bib25","doi-asserted-by":"crossref","DOI":"10.1002\/cpa.3160230204","article-title":"On the number of multiplications necessary to compute certain functions","volume":"23","author":"Winograd","year":"1970","journal-title":"Comm. Pure Appl. Math."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800292?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800292?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T23:52:18Z","timestamp":1544140338000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,6]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,6]]}},"alternative-id":["S0022000074800292"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80029-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,6]]}}}