{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:27:08Z","timestamp":1773228428233,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,6,30]],"date-time":"2005-06-30T00:00:00Z","timestamp":1120089600000},"content-version":"vor","delay-in-days":6604,"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 Complexity"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1016\/0885-064x(87)90022-7","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:01:23Z","timestamp":1099764083000},"page":"90-113","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":102,"title":["On the worst-case arithmetic complexity of approximating zeros of polynomials"],"prefix":"10.1016","volume":"3","author":[{"given":"James","family":"Renegar","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(87)90022-7_BIB1","series-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"Borodin","year":"1975"},{"key":"10.1016\/0885-064X(87)90022-7_BIB2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","article-title":"An algorithm for the machine computation of complex fourier series","volume":"19","author":"Cooley","year":"1965","journal-title":"Math. Comp."},{"key":"10.1016\/0885-064X(87)90022-7_BIB3","series-title":"On zero finding methods of higher order from data at one point","author":"Curry","year":"1986"},{"key":"10.1016\/0885-064X(87)90022-7_BIB4","author":"Kim","year":"1985"},{"key":"10.1016\/0885-064X(87)90022-7_BIB5","series-title":"Applied and Computational Complex Analysis","author":"Henrici","year":"1974"},{"key":"10.1016\/0885-064X(87)90022-7_BIB6","series-title":"Constructive Aspects of the Fundamental Theorem of Algebra","article-title":"Uniformly convergent algorithms for the simultaneous approximation of all zeros of a polynomial","author":"Henrici","year":"1969"},{"key":"10.1016\/0885-064X(87)90022-7_BIB7","series-title":"Geometry of Polynomials","author":"Marden","year":"1966"},{"key":"10.1016\/0885-064X(87)90022-7_BIB8","article-title":"The Fundamental Theorem of Algebra in Terms of Computational Complexity","author":"Sch\u00f6nhage","year":"1982"},{"key":"10.1016\/0885-064X(87)90022-7_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1981-14858-8","article-title":"The fundamental theorem of algebra and complexity theory","volume":"4","author":"Smale","year":"1981","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0885-064X(87)90022-7_BIB10","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/S0273-0979-1985-15391-1","article-title":"On the efficiency of algorithms of analysis","volume":"13","author":"Smale","year":"1985","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0885-064X(87)90022-7_BIB11","series-title":"The Merging of Disciplines: New Directions in Pure, Applied and Computational Mathematics","article-title":"Newton's method estimates from data at one point","author":"Smale","year":"1986"},{"key":"10.1016\/0885-064X(87)90022-7_BIB12","series-title":"Proceedings, International Congress of Mathematicians","article-title":"Algorithms for solving equations","author":"Smale","year":"1986"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X87900227?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X87900227?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T09:47:30Z","timestamp":1734083250000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X87900227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["0885064X87900227"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(87)90022-7","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the worst-case arithmetic complexity of approximating zeros of polynomials","name":"articletitle","label":"Article Title"},{"value":"Journal of Complexity","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0885-064X(87)90022-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1987 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}