{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:21:33Z","timestamp":1773800493077,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Mathematics with Applications"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0898-1221(96)00233-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"1-23","source":"Crossref","is-referenced-by-count":8,"title":["A fast and stable algorithm for splitting polynomials"],"prefix":"10.1016","volume":"33","author":[{"given":"G.","family":"Malajovich","sequence":"first","affiliation":[]},{"given":"J.P.","family":"Zubelli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0898-1221(96)00233-7_BIB1","article-title":"Solving a polynomial equation: Some history and recent progress","author":"Pan","year":"1995"},{"key":"10.1016\/S0898-1221(96)00233-7_BIB2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02546329","article-title":"Recherches sur la m\u00e9thode de Graeffe et les z\u00e9ros des polynomes et des s\u00e9ries de Laurent","volume":"72","author":"Ostrowski","year":"1940","journal-title":"Acta Mathematica"},{"key":"10.1016\/S0898-1221(96)00233-7_BIB3","series-title":"Theory of Equations","author":"Uspensky","year":"1948"},{"key":"10.1016\/S0898-1221(96)00233-7_BIB4","series-title":"Proceedings of the International Congress of Mathematicians","first-page":"131","article-title":"Equation solving in terms of computational complexity","author":"Sch\u00f6nhage","year":"1987"},{"key":"10.1016\/S0898-1221(96)00233-7_BIB5","article-title":"Partial fraction decomposition in C(z) and simultaneous Newton iteration for factorization in C[z]","author":"Kirrinis","year":"1995","journal-title":"preprint"},{"issue":"12","key":"10.1016\/S0898-1221(96)00233-7_BIB6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0898-1221(96)00080-6","article-title":"Optimal and nearly optimal algorithms for approximating polynomial zeros","volume":"31","author":"Pan","year":"1996","journal-title":"Computers Math. Applic."},{"issue":"2","key":"10.1016\/S0898-1221(96)00233-7_BIB7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0898-1221(95)00078-D","article-title":"Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant","volume":"30","author":"Pan","year":"1995","journal-title":"Computers Math. Applic."},{"key":"10.1016\/S0898-1221(96)00233-7_BIB8","series-title":"The Merging of Disciplines: New Directions in Pure, Applied and Computational Mathematics","article-title":"Newton method estimates from data at one point","author":"Smale","year":"1986"},{"issue":"2","key":"10.1016\/S0898-1221(96)00233-7_BIB9","article-title":"On the complexity of Bezout's Theorem I: Geometric aspects","volume":"6","author":"Shub","year":"1993","journal-title":"Journal of the AMS"},{"key":"10.1016\/S0898-1221(96)00233-7_BIB10","first-page":"267","article-title":"On the complexity of Bezout's Theorem II: Volumes and probabilities","volume":"Volume 109","author":"Shub","year":"1993"},{"key":"10.1016\/S0898-1221(96)00233-7_BIB11","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1006\/jcom.1993.1002","article-title":"Complexity of Bezout's Theorem III: Condition number and packing","volume":"9","author":"Shub","year":"1993","journal-title":"Journal of Complexity"},{"key":"10.1016\/S0898-1221(96)00233-7_BIB12","article-title":"Complexity of Bezout's Theorem IV: Probability of success; extensions","author":"Shub","year":"1993","journal-title":"preprint"},{"issue":"1","key":"10.1016\/S0898-1221(96)00233-7_BIB13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(94)90122-8","article-title":"Complexity of Bezout's Theorem V: Polynomial time","volume":"133","author":"Shub","year":"1994","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0898-1221(96)00233-7_BIB14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0304-3975(94)00065-4","article-title":"On generalized Newton algorithms: Quadratic convergence path-following and error analysis","volume":"133","author":"Malajovich","year":"1994","journal-title":"Theoretical Computer Science"}],"container-title":["Computers & Mathematics with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0898122196002337?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0898122196002337?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:25:58Z","timestamp":1555190758000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0898122196002337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0898122196002337"],"URL":"https:\/\/doi.org\/10.1016\/s0898-1221(96)00233-7","relation":{},"ISSN":["0898-1221"],"issn-type":[{"value":"0898-1221","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}