{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T11:36:13Z","timestamp":1787312173912,"version":"build-2736575974"},"reference-count":32,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"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":6986,"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":[[1994,6]]},"DOI":"10.1016\/s0022-0000(05)80061-3","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T07:18:35Z","timestamp":1124522315000},"page":"429-463","source":"Crossref","is-referenced-by-count":31,"title":["Specified precision polynomial root isolation is in NC"],"prefix":"10.1016","volume":"48","author":[{"given":"C. Andrew","family":"Neff","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80061-3_bib1","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1137\/0217069","article-title":"A fast parallel algorithm for determining all roots of a polynomial with real roots","volume":"17","author":"Ben-Or","year":"1988","journal-title":"Siam J. Comput."},{"key":"10.1016\/S0022-0000(05)80061-3_bib2","series-title":"Proceedings 16th ACM Symposium on Theory of Computing","first-page":"457","article-title":"The complexity of elementary algebra and geometry","author":"Ben-Or","year":"1984"},{"key":"10.1016\/S0022-0000(05)80061-3_bib3","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0885-064X(90)90032-9","article-title":"Simple algorithms for approximating all roots of a polynomial with real roots","volume":"6","author":"Ben-Or","year":"1990","journal-title":"J. Complexity"},{"key":"10.1016\/S0022-0000(05)80061-3_bib4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","article-title":"On computing the determinant in small parallel time using a small number of processors","volume":"18","author":"Berkowitz","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(05)80061-3_bib5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0019-9958(82)90766-5","article-title":"Fast parallel matrix and GCD computations","volume":"52","author":"Borodin","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80061-3_bib6","volume":"Vols. 1 and 2","author":"Burnside","year":"1960"},{"key":"10.1016\/S0022-0000(05)80061-3_bib7","series-title":"Proceedings, 20th ACM Symposium on Theory of Computing","first-page":"460","article-title":"Some algebraic and geometric computations in PSPACE","author":"Canny","year":"1988"},{"key":"10.1016\/S0022-0000(05)80061-3_bib8","doi-asserted-by":"crossref","first-page":"708","DOI":"10.2307\/2313976","article-title":"Polynomial remainder sequences and determinants","volume":"73","author":"Collins","year":"1966","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0022-0000(05)80061-3_bib9","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/321371.321381","article-title":"Subresultants and reduced polynomial remainder sequences","volume":"14","author":"Collins","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80061-3_bib10","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\/S0022-0000(05)80061-3_bib11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(89)90173-7","article-title":"Parallel evaluation of the determinant and of the inverse of a matrix","volume":"30","author":"Galil","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(05)80061-3_bib12","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1137\/0213050","article-title":"Parallel algorithms for algebraic problems","volume":"13","author":"von zur Gathen","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80061-3_bib13","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1137\/0215030","article-title":"Representations of rational functions","volume":"15","author":"von zur Gathen","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80061-3_bib14","volume":"Vols. 1, 2, 3","author":"Henrici","year":"1974"},{"key":"10.1016\/S0022-0000(05)80061-3_bib15","series-title":"The Numerical Treatment of a Single Nonlinear Equation","author":"Householder","year":"1970"},{"key":"10.1016\/S0022-0000(05)80061-3_bib16","unstructured":"E. Kaltofen, Effective Noether irreducibility forms and applications, manuscript."},{"key":"10.1016\/S0022-0000(05)80061-3_bib17","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0747-7171(85)80029-8","article-title":"Fast parallel absolute irreducibility testing","volume":"1","author":"Kaltofen","year":"1985","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0022-0000(05)80061-3_bib18","volume":"Vol. 2","author":"Knuth","year":"1981"},{"key":"10.1016\/S0022-0000(05)80061-3_bib19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1307\/mmj\/1028999140","article-title":"An inequality for the discriminant of a polynomial","volume":"11","author":"Mahler","year":"1964","journal-title":"Michigan Math. J."},{"key":"10.1016\/S0022-0000(05)80061-3_bib20","article-title":"Geometry of Polynomials","volume":"3","author":"Marden","year":"1966"},{"key":"10.1016\/S0022-0000(05)80061-3_bib21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0304-3975(87)90019-3","article-title":"Complexity of Parallel matrix computations","volume":"54","author":"Pan","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80061-3_bib22","series-title":"26th Annual IEEE Symposium on Foundations of Computer Science","first-page":"522","article-title":"Fast and efficient algorithms for sequential and parallel evaluation of polynomial zeros and of matrix polynomials","author":"Pan","year":"1985"},{"key":"10.1016\/S0022-0000(05)80061-3_bib23","series-title":"Proceedings, 17th ACM Symposium on Theory of Computing","first-page":"143","article-title":"Efficient parallel solution of linear systems","author":"Pan","year":"1985"},{"key":"10.1016\/S0022-0000(05)80061-3_bib24","article-title":"On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae","author":"Renegar","year":"1989","journal-title":"Cornell University Tech. Rep. No. 858"},{"key":"10.1016\/S0022-0000(05)80061-3_bib25","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/0218024","article-title":"On the worst case arithmetic complexity of approximating zeros of systems of polynomials","volume":"18","author":"Renegar","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80061-3_bib26","series-title":"Proceedings 29th IEEE Symposium on Foundations of Computer Science","first-page":"291","article-title":"A faster PSPACE algorithm for deciding the existential theory of the reals","author":"Renegar","year":"1988"},{"key":"10.1016\/S0022-0000(05)80061-3_bib27","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF01582052","article-title":"On the cost of approximating all roots of a complex polynomial","volume":"32","author":"Renegar","year":"1985","journal-title":"Math. Prog."},{"key":"10.1016\/S0022-0000(05)80061-3_bib28","series-title":"Real and Complex Analysis","author":"Rudin","year":"1974"},{"key":"10.1016\/S0022-0000(05)80061-3_bib29","series-title":"The fundamental theorem of algebra in terms of computational complexity","author":"Sch\u00f6nhage","year":"1982"},{"key":"10.1016\/S0022-0000(05)80061-3_bib30","article-title":"The Communication Complexity of Distributed Computing and a Parallel Algorithm for Polynomial Roots","author":"Tiwari","year":"1986"},{"key":"10.1016\/S0022-0000(05)80061-3_bib31","series-title":"Theory of Equations","author":"Uspensky","year":"1948"},{"key":"10.1016\/S0022-0000(05)80061-3_bib32","article-title":"Finding Zeros of Polynomials in Parallel","author":"Zuckerman","year":"1987"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800613?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800613?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T17:27:36Z","timestamp":1548178056000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["S0022000005800613"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80061-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}