{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:01:35Z","timestamp":1760061695314,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T00:00:00Z","timestamp":1372204800000},"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":[[2013,6,26]]},"DOI":"10.1145\/2465506.2465938","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"299-306","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["On the boolean complexity of real root refinement"],"prefix":"10.1145","author":[{"given":"Victor Y.","family":"Pan","sequence":"first","affiliation":[{"name":"City University of New York, Bronx, New York, NY, USA"}]},{"given":"Elias P.","family":"Tsigaridas","sequence":"additional","affiliation":[{"name":"INRIA, Paris-Rocquencourt Center, PolSys Project, UPMC, Univ Paris 06, LIP6, CNRS, UMR 7606, LIP6, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2013,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ISSAC 2006","author":"Abbott J.","year":"2006","unstructured":"J. Abbott . Quadratic interval refinement for real roots . In ISSAC 2006 , poster presentation, 2006 . http:\/\/www.dima.unige.it\/ J. Abbott. Quadratic interval refinement for real roots. In ISSAC 2006, poster presentation, 2006. http:\/\/www.dima.unige.it\/"},{"key":"e_1_3_2_1_2_1","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"Basu S.","year":"2006","unstructured":"S. Basu , R. Pollack , and M- F. Roy . Algorithms in Real Algebraic Geometry , volume 10 of Algorithms and Computation in Mathematics . Springer-Verlag , 2 nd edition, 2006 . S. Basu, R. Pollack, and M-F.Roy. Algorithms in Real Algebraic Geometry, volume 10 of Algorithms and Computation in Mathematics. Springer-Verlag, 2nd edition, 2006.","edition":"2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(90)90032-9"},{"key":"e_1_3_2_1_4_1","first-page":"127","volume-title":"Numerical Algorithms","author":"Bini D.","year":"2000","unstructured":"D. Bini and G. Fiorentino . Design, analysis, and implementation of a multiprecision polynomial rootfinder . Numerical Algorithms , pages 127 -- 173 , 2000 . D. Bini and G. Fiorentino. Design, analysis, and implementation of a multiprecision polynomial rootfinder. Numerical Algorithms, pages 127--173, 2000."},{"key":"e_1_3_2_1_5_1","volume-title":"Fundamental Algorithms","author":"Bini D.","year":"1994","unstructured":"D. Bini and V. Pan . Polynomial and Matrix Computations , volume 1 : Fundamental Algorithms . Birkh\u00e4user , Boston , 1994 . D. Bini and V. Pan. Polynomial and Matrix Computations, volume 1: Fundamental Algorithms. Birkh\u00e4user, Boston, 1994."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/127787.127855"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02241709"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539790182482"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/265020"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2011.17"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542362.1542424"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/164081.164090"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.04.009"},{"key":"e_1_3_2_1_15_1","first-page":"113","volume-title":"Int. Workshop on Symbolic Numeric Computing","author":"Du Z.","year":"2005","unstructured":"Z. Du , V. Sharma , and C. K. Yap . Amortized bound for root isolation via Sturm sequences. In D. Wang and L. Zhi, editors , Int. Workshop on Symbolic Numeric Computing , pages 113 -- 129 , School of Science, Beihang University, Beijing, China , 2005 . Birkhauser. Z. Du, V. Sharma, and C. K. Yap. Amortized bound for root isolation via Sturm sequences. In D. Wang and L. Zhi, editors, Int. Workshop on Symbolic Numeric Computing, pages 113--129, School of Science, Beihang University, Beijing, China, 2005. Birkhauser."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442854"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837934.1837980"},{"key":"e_1_3_2_1_19_1","series-title":"LNCS","first-page":"200","volume-title":"Proc. CASC","author":"Hart W.","year":"2011","unstructured":"W. Hart and A. Novocin . Practical divide-and-conquer algorithms for polynomial arithmetic . In Proc. CASC , volume 6885 of LNCS , pages 200 -- 214 . Springer , 2011 . W. Hart and A. Novocin. Practical divide-and-conquer algorithms for polynomial arithmetic. In Proc. CASC, volume 6885 of LNCS, pages 200--214. Springer, 2011."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04103-7_15"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993920"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.11.001"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.01.009"},{"key":"e_1_3_2_1_25_1","volume-title":"Numerical methods for roots of polynomials (II)","author":"McNamee J. M.","year":"2013","unstructured":"J. M. McNamee and V. Y. Pan . Numerical methods for roots of polynomials (II) , chapter 15. Elsevier , 2013 . J. M. McNamee and V. Y. Pan. Numerical methods for roots of polynomials (II), chapter 15. Elsevier, 2013."},{"key":"e_1_3_2_1_26_1","volume-title":"Mathematics for Computer Algebra","author":"Mignotte M.","year":"1991","unstructured":"M. Mignotte . Mathematics for Computer Algebra . Springer-Verlag , New York , 1991 . M. Mignotte. Mathematics for Computer Algebra. Springer-Verlag, New York, 1991."},{"key":"e_1_3_2_1_27_1","volume-title":"Optimal and nearly optimal algorithms for approximating polynomial zeros. Comp. and Math. (with Appl.), 31:97--138","author":"Pan V.","year":"1996","unstructured":"V. Pan . Optimal and nearly optimal algorithms for approximating polynomial zeros. Comp. and Math. (with Appl.), 31:97--138 , 1996 . V. Pan. Optimal and nearly optimal algorithms for approximating polynomial zeros. Comp. and Math. (with Appl.), 31:97--138, 1996."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1999.0532"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2002.0531"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019146505291"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277500.1277524"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(87)90022-7"},{"key":"e_1_3_2_1_34_1","first-page":"100","article-title":"On solving systems of bivariate polynomials","volume":"2010","author":"Rouillier F.","year":"2010","unstructured":"F. Rouillier . On solving systems of bivariate polynomials . Mathematical Software-ICMS 2010 , 6327: 100 -- 104 , 2010 . F. Rouillier. On solving systems of bivariate polynomials. Mathematical Software-ICMS 2010, 6327:100--104, 2010.","journal-title":"Mathematical Software-ICMS"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442872"},{"key":"e_1_3_2_1_36_1","volume-title":"Manuscript","author":"Sch\u00f6nhage A.","year":"1982","unstructured":"A. Sch\u00f6nhage . The fundamental theorem of algebra in terms of computational complexity . Manuscript . Univ. of T\u00fcbingen, Germany , 1982 . URL: http:\/\/www.iai.uni-bonn.de\/~schoe\/fdthmrep.ps.gz. A. Sch\u00f6nhage. The fundamental theorem of algebra in terms of computational complexity. Manuscript. Univ. of T\u00fcbingen, Germany, 1982. URL: http:\/\/www.iai.uni-bonn.de\/~schoe\/fdthmrep.ps.gz."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_77"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993934"},{"key":"e_1_3_2_1_39_1","volume-title":"Modern Computer Algebra","author":"von zur Gathen J.","year":"2003","unstructured":"J. von zur Gathen and J. Gerhard . Modern Computer Algebra . Cambridge Univ. Press , Cambridge, U.K. , 2 nd edition, 2003 . J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge Univ. Press, Cambridge, U.K., 2nd edition, 2003.","edition":"2"},{"key":"e_1_3_2_1_40_1","volume-title":"Oxford University Press","author":"Yap C.","year":"2000","unstructured":"C. Yap . Fundamental Problems of Algorithmic Algebra . Oxford University Press , New York , 2000 . C. Yap. Fundamental Problems of Algorithmic Algebra. Oxford University Press, New York, 2000."}],"event":{"name":"ISSAC'13: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Boston Maine USA","acronym":"ISSAC'13"},"container-title":["Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465506.2465938","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2465506.2465938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:36Z","timestamp":1750234716000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465506.2465938"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,26]]},"references-count":36,"alternative-id":["10.1145\/2465506.2465938","10.1145\/2465506"],"URL":"https:\/\/doi.org\/10.1145\/2465506.2465938","relation":{},"subject":[],"published":{"date-parts":[[2013,6,26]]},"assertion":[{"value":"2013-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}