{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:35Z","timestamp":1750307315516,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T00:00:00Z","timestamp":1307491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,8]]},"DOI":"10.1145\/1993886.1993938","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T14:45:32Z","timestamp":1308062732000},"page":"353-360","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["A simple but exact and efficient algorithm for complex root isolation"],"prefix":"10.1145","author":[{"given":"Chee K.","family":"Yap","sequence":"first","affiliation":[{"name":"New York University, New York, USA"}]},{"given":"Michael","family":"Sagraloff","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbruecken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2011,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.15388\/NA.2005.10.4.15110"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972917.4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02207694"},{"key":"e_1_3_2_1_4_1","unstructured":"D. A. Bini and G. Fiorentino. Numerical Computation of Polynomial Roots Using MPSolve Version 2.2. Dipartimento di Matematica Universita\u00e1 di Pisa Via Bonarroti 2 56127 Pisa January 2000. Manual for the Mpsolve package. Available at ftp:\/\/ftp.dm.unipi.it\/pub\/mpsolve\/MPSolve-2.2.tgz.  D. A. Bini and G. Fiorentino. Numerical Computation of Polynomial Roots Using MPSolve Version 2.2. Dipartimento di Matematica Universita\u00e1 di Pisa Via Bonarroti 2 56127 Pisa January 2000. Manual for the Mpsolve package. Available at ftp:\/\/ftp.dm.unipi.it\/pub\/mpsolve\/MPSolve-2.2.tgz."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390768.1390783"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.08.022"},{"key":"e_1_3_2_1_7_1","unstructured":"M. Burr F. Krahmer and C. Yap. Continuous amortization: A non-probabilistic adaptive analysis technique. Electronic Colloquium on Computational Complexity (ECCC) TR09(136) December 2009.  M. Burr F. Krahmer and C. Yap. Continuous amortization: A non-probabilistic adaptive analysis technique. Electronic Colloquium on Computational Complexity (ECCC) TR09(136) December 2009."},{"key":"e_1_3_2_1_8_1","unstructured":"M. Burr V. Sharma and C. Yap. Evaluation-based root isolation 2011. In preparation.  M. Burr V. Sharma and C. Yap. Evaluation-based root isolation 2011. In preparation."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/800205.806346"},{"key":"e_1_3_2_1_11_1","first-page":"239","article-title":"Localization of an algebraic hypersurface by the exclusion algorithm. Applicable Algbebra in Engineering","volume":"2","author":"Dedieu J.-P.","year":"1992","journal-title":"Communication and Computing"},{"key":"e_1_3_2_1_12_1","first-page":"113","volume-title":"Trends in Mathematics","author":"Du Z.","year":"2007"},{"volume-title":"University of Saarland","year":"2008","author":"Eigenwillig A.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11555964_12"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145786"},{"key":"e_1_3_2_1_16_1","first-page":"3218","article-title":"Modular algorithms in symbolic summation and symbolic integration. LNCS","author":"Gerhard J.","year":"2004","journal-title":"Springer"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"J. Johnson. Algorithms for polynomial real root isolation. In B. Caviness and J. Johnson editors Quantifier Elimination and Cylindrical Algebraic Decomposition Texts and monographs in Symbolic Computation pages 269--299. Springer 1998.  J. Johnson. Algorithms for polynomial real root isolation. In B. Caviness and J. Johnson editors Quantifier Elimination and Cylindrical Algebraic Decomposition Texts and monographs in Symbolic Computation pages 269--299. Springer 1998.","DOI":"10.1007\/978-3-7091-9459-1_13"},{"volume-title":"Oxford Computing Laboratory","year":"2010","author":"Kamath N.","key":"e_1_3_2_1_18_1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/143242.143308"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2005.02.004"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2000.0427"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542362.1542423"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(93)90064-I"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2011.06.001"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1576702.1576737"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/93267.93276"},{"key":"e_1_3_2_1_27_1","unstructured":"R. E. Moore. Interval Analysis. Prentice Hall Englewood Cliffs NJ 1966.  R. E. Moore. Interval Analysis. Prentice Hall Englewood Cliffs NJ 1966."},{"volume-title":"Cambridge University Press","year":"2005","author":"Mourrain B.","key":"e_1_3_2_1_28_1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.2001.0636"},{"key":"e_1_3_2_1_30_1","first-page":"260","volume-title":"Proc. 5th ACM-SIAM Symp. on Discrete Algorithms (SODA94)","author":"Pan V. Y.","year":"1994"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225292"},{"volume-title":"Sophia-Antipolis","year":"1996","author":"Pan V. Y.","key":"e_1_3_2_1_32_1"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144595288554"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/355705.355710"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1057432.1057465"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/258726.258792"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2003.08.015"},{"key":"e_1_3_2_1_38_1","unstructured":"M. Sagraloff. Root isolation for bitstream polynomials with adaptive approximation demand 2011. Submitted full paper from http:\/\/www.mpi-inf.mpg.de\/ msagralo\/.  M. Sagraloff. Root isolation for bitstream polynomials with adaptive approximation demand 2011. Submitted full paper from http:\/\/www.mpi-inf.mpg.de\/ msagralo\/."},{"key":"e_1_3_2_1_39_1","unstructured":"M. Sagraloff and C. K. Yap. An efficient exact subdivision algorithm for isolating complex roots of a polynomial and its complexity analysis July 2009. Submitted. Full paper from http:\/\/cs.nyu.edu\/exact\/ or http:\/\/http:\/\/www.mpi-inf.mpg.de\/msagralo\/.  M. Sagraloff and C. K. Yap. An efficient exact subdivision algorithm for isolating complex roots of a polynomial and its complexity analysis July 2009. Submitted. Full paper from http:\/\/cs.nyu.edu\/exact\/ or http:\/\/http:\/\/www.mpi-inf.mpg.de\/msagralo\/."},{"key":"e_1_3_2_1_40_1","unstructured":"A. Sch\u00f6nhage. The fundamental theorem of algebra in terms of computational complexity 1982. Manuscript Department of Mathematics University of T\u00fcbingen. Updated 2004.  A. Sch\u00f6nhage. The fundamental theorem of algebra in terms of computational complexity 1982. Manuscript Department of Mathematics University of T\u00fcbingen. Updated 2004."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.017"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"S. Smale. The fundamental theorem of algebra and complexity theory. Bulletin (N.S.) of the AMS 4(1):1--36 1981.  S. Smale. The fundamental theorem of algebra and complexity theory. Bulletin (N.S.) of the AMS 4(1):1--36 1981.","DOI":"10.1090\/S0273-0979-1981-14858-8"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/38.267467"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.10.010"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322084"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2005.06.007"},{"key":"e_1_3_2_1_47_1","unstructured":"C. K. Yap. Fundamental Problems of Algorithmic Algebra. Oxford University Press 2000.   C. K. Yap. Fundamental Problems of Algorithmic Algebra. Oxford University Press 2000."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888390.1888421"}],"event":{"name":"ISSAC '11: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"San Jose California USA","acronym":"ISSAC '11"},"container-title":["Proceedings of the 36th international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993886.1993938","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993886.1993938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:47Z","timestamp":1750244747000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993886.1993938"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,8]]},"references-count":47,"alternative-id":["10.1145\/1993886.1993938","10.1145\/1993886"],"URL":"https:\/\/doi.org\/10.1145\/1993886.1993938","relation":{},"subject":[],"published":{"date-parts":[[2011,6,8]]},"assertion":[{"value":"2011-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}