{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T08:27:16Z","timestamp":1773217636292,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2009,5,28]],"date-time":"2009-05-28T00:00:00Z","timestamp":1243468800000},"content-version":"vor","delay-in-days":7332,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1016\/s0747-7171(89)80027-6","type":"journal-article","created":{"date-parts":[[2008,5,29]],"date-time":"2008-05-29T06:22:56Z","timestamp":1212042176000},"page":"445-456","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":68,"title":["Polynomial decomposition algorithms"],"prefix":"10.1016","volume":"7","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[]},{"given":"Susan","family":"Landau","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(89)80027-6_bib1","series-title":"Proc. EUROCAL85","first-page":"150","article-title":"Fast polynomial decomposition algorithms","volume":"204","author":"Alagar","year":"1985"},{"key":"10.1016\/S0747-7171(89)80027-6_bib2","doi-asserted-by":"crossref","first-page":"159=168","DOI":"10.1016\/S0747-7171(85)80012-2","article-title":"Polynomial decomposition algorithms","volume":"1","author":"Barton","year":"1985","journal-title":"J. Symb. Comp."},{"key":"10.1016\/S0747-7171(89)80027-6_bib3","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1145\/322092.322099","article-title":"Fast algorithms for manipulating formal power series","volume":"25","author":"Brent","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0747-7171(89)80027-6_bib4","series-title":"Proc. 2nd SIAM Conf. on Appl. Linear Algebra","article-title":"A public key cipher which allows signatures","author":"Cade","year":"1985"},{"key":"10.1016\/S0747-7171(89)80027-6_bib5","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","article-title":"Fast parallel matrix inversion algorithms","volume":"5","author":"Csanky","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0747-7171(89)80027-6_bib6","article-title":"Polynomial decomposition algorithms","author":"Dickerson","year":"1987"},{"key":"10.1016\/S0747-7171(89)80027-6_bib7","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0021-8693(74)90023-4","article-title":"Prime and composite polynomials","volume":"28","author":"Dorey","year":"1974","journal-title":"J. Algebra"},{"key":"10.1016\/S0747-7171(89)80027-6_bib8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.2307\/2371520","article-title":"Polynomial substitutions","volume":"63","author":"Engstrom","year":"1941","journal-title":"Am. J. Math."},{"key":"10.1016\/S0747-7171(89)80027-6_bib9","first-page":"91","article-title":"Analytic number theory","author":"Gallagher","year":"1972"},{"key":"10.1016\/S0747-7171(89)80027-6_bib10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1112\/plms\/s2-17.1.75","volume":"17","author":"Hardy","year":"1918","journal-title":"Proceedings, London Math. Soc."},{"key":"10.1016\/S0747-7171(89)80027-6_bib11","first-page":"165","article-title":"On the invariance of chains of fields","volume":"13","author":"Fried","year":"1969","journal-title":"Ill. J. Math."},{"key":"10.1016\/S0747-7171(89)80027-6_bib12","series-title":"Proc. 17th ACM Symp. Theory of Computing","first-page":"38","article-title":"The parallel complexity of exponentiating polynomials over finite fields","author":"Fich","year":"1985"},{"key":"10.1016\/S0747-7171(89)80027-6_bib13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0022-0000(85)90013-3","article-title":"Solvability by radicals is in polynomial time","volume":"30","author":"Landau","year":"1985","journal-title":"J. Comp. Syst. Sci."},{"key":"10.1016\/S0747-7171(89)80027-6_bib14","doi-asserted-by":"crossref","first-page":"389","DOI":"10.2307\/2371692","article-title":"Composite polynomials with coefficients in an arbitrary field of characteristic zero","volume":"64","author":"Levi","year":"1942","journal-title":"Am. J. Math."},{"key":"10.1016\/S0747-7171(89)80027-6_bib15","author":"Press","year":"1986","journal-title":"Numerical Recipes: The Art of Scientific Computing. Cambridge"},{"key":"10.1016\/S0747-7171(89)80027-6_bib16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1090\/S0002-9947-1922-1501189-9","article-title":"Prime and composite polynomials","volume":"23","author":"Ritt","year":"1922","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/S0747-7171(89)80027-6_bib17","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1137\/0212043","article-title":"Fast parallel computation of polynomials using few processors","volume":"12","author":"Valiant","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0747-7171(89)80027-6_bib18","series-title":"Proc. 28th IEEE Symp. Found. Comp. Sci.","first-page":"127","article-title":"Functional decomposition of polynomials","author":"von zur Gathen","year":"1987"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717189800276?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717189800276?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T07:47:47Z","timestamp":1759996067000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717189800276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["S0747717189800276"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(89)80027-6","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Polynomial decomposition algorithms","name":"articletitle","label":"Article Title"},{"value":"Journal of Symbolic Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0747-7171(89)80027-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}