{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:20Z","timestamp":1750307000907,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,7]],"date-time":"2012-06-07T00:00:00Z","timestamp":1339027200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0728977CCF-0917093"],"award-info":[{"award-number":["CCF-0728977CCF-0917093"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,7]]},"DOI":"10.1145\/2331684.2331710","type":"proceedings-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T14:38:27Z","timestamp":1342708707000},"page":"155-164","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Empirical study of an evaluation-based subdivision algorithm for complex root isolation"],"prefix":"10.1145","author":[{"given":"Narayan","family":"Kamath","sequence":"first","affiliation":[{"name":"Google, Inc. and Oxford Computing Lab, UK"}]},{"given":"Irina","family":"Voiculescu","sequence":"additional","affiliation":[{"name":"Oxford University, UK"}]},{"given":"Chee K.","family":"Yap","sequence":"additional","affiliation":[{"name":"Courant Institute, NYU and Oxford Computing Lab, UK"}]}],"member":"320","published-online":{"date-parts":[[2012,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972917.4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02207694"},{"key":"e_1_3_2_1_3_1","unstructured":"D. A. Bini and G. Fiorentino. MPSolve: manual for the MPSolve package. http:\/\/www.dm.unipi.it\/cluster-pages\/mpsolve\/mpsolve.pdf.  D. A. Bini and G. Fiorentino. MPSolve: manual for the MPSolve package. http:\/\/www.dm.unipi.it\/cluster-pages\/mpsolve\/mpsolve.pdf."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019199917103"},{"key":"e_1_3_2_1_5_1","volume-title":"TR09(136)","author":"Burr M.","year":"2009","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_6_1","volume-title":"Evaluation-based root isolation","author":"Burr M.","year":"2011","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_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542362.1542424"},{"key":"e_1_3_2_1_8_1","volume-title":"KLMM","author":"Cheng J.-S.","year":"2008","unstructured":"J.-S. Cheng , X.-S. Gao , and J. Li . Root isolation for bivariate polynomial systems with local generic position method. Mm research preprints , KLMM , Chinese Academy of Sciences , 2008 . J.-S. Cheng, X.-S. Gao, and J. Li. Root isolation for bivariate polynomial systems with local generic position method. Mm research preprints, KLMM, Chinese Academy of Sciences, 2008."},{"key":"e_1_3_2_1_9_1","volume-title":"since","author":"Core Library","year":"1999","unstructured":"Core Library homepage , since 1999 . Software download, source, documentation and links: http:\/\/cs.nyu.edu\/exact\/core\/. Core Library homepage, since 1999. Software download, source, documentation and links: http:\/\/cs.nyu.edu\/exact\/core\/."},{"key":"e_1_3_2_1_10_1","first-page":"239","article-title":"Localization of an algebraic hypersurface by the exclusion algorithm. Applicable Algebra in Engineering","volume":"2","author":"Dedieu J.-P.","year":"1992","unstructured":"J.-P. Dedieu and J.-C. Yakoubsohn . Localization of an algebraic hypersurface by the exclusion algorithm. Applicable Algebra in Engineering , Communication and Computing , 2 : 239 -- 256 , 1992 . J.-P. Dedieu and J.-C. Yakoubsohn. Localization of an algebraic hypersurface by the exclusion algorithm. Applicable Algebra in Engineering, Communication and Computing, 2:239--256, 1992.","journal-title":"Communication and Computing"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.04.009"},{"key":"e_1_3_2_1_12_1","first-page":"22","article-title":"On solving systems of equations using interval arithmetic","author":"Hansen E. R.","year":"1968","unstructured":"E. R. Hansen . On solving systems of equations using interval arithmetic . Math. Comp. , 22 , 1968 . E. R. Hansen. On solving systems of equations using interval arithmetic. Math. Comp., 22, 1968.","journal-title":"Math. Comp."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932020"},{"key":"e_1_3_2_1_14_1","volume-title":"Subdivision algorithms for complex root isolation: Empirical comparisons. Master's thesis","author":"Kamath N.","year":"2010","unstructured":"N. Kamath . Subdivision algorithms for complex root isolation: Empirical comparisons. Master's thesis , Oxford University , Oxford Computing Laboratory, Aug. 2010 . N. Kamath. Subdivision algorithms for complex root isolation: Empirical comparisons. Master's thesis, Oxford University, Oxford Computing Laboratory, Aug. 2010."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02234767"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-011-9345-9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/93267.93276"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0714072"},{"key":"e_1_3_2_1_19_1","volume-title":"Interval Analysis","author":"Moore R. E.","year":"1966","unstructured":"R. E. Moore . Interval Analysis . Prentice Hall , Englewood Cliffs, NJ , 1966 . R. E. Moore. Interval Analysis. Prentice Hall, Englewood Cliffs, NJ, 1966."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0714040"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0719060"},{"key":"e_1_3_2_1_22_1","first-page":"459","volume-title":"Combinatorial and Computational Geometry, number 52 in MSRI","author":"Mourrain B.","year":"2005","unstructured":"B. Mourrain , F. Rouillier , and M.-F. Roy . The Bernstein basis and real root isolation . In J. E. Goodman, J. Pach, and E. Welzl, editors, Combinatorial and Computational Geometry, number 52 in MSRI Publications, pages 459 -- 478 . Cambridge University Press , 2005 . B. Mourrain, F. Rouillier, and M.-F. Roy. The Bernstein basis and real root isolation. In J. E. Goodman, J. Pach, and E. Welzl, editors, Combinatorial and Computational Geometry, number 52 in MSRI Publications, pages 459--478. Cambridge University Press, 2005."},{"key":"e_1_3_2_1_23_1","volume-title":"Cambridge University Press","author":"Neumaier A.","year":"1990","unstructured":"A. Neumaier . Interval Methods for Systems of Equations . Cambridge University Press , Cambridge , 1990 . A. Neumaier. Interval Methods for Systems of Equations. Cambridge University Press, Cambridge, 1990."},{"key":"e_1_3_2_1_24_1","volume-title":"Research Memorandum MRC Technical Summary Report #1136","author":"Nickel K.","year":"1971","unstructured":"K. Nickel . On the Newton Method in Interval Analysis . Research Memorandum MRC Technical Summary Report #1136 , University of Wisconsin , Madison , 1971 . K. Nickel. On the Newton Method in Interval Analysis. Research Memorandum MRC Technical Summary Report #1136, University of Wisconsin, Madison, 1971."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144595288554"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1057432.1057465"},{"key":"e_1_3_2_1_27_1","volume-title":"Computer Methods for the Range of Functions","author":"Ratschek H.","year":"1984","unstructured":"H. Ratschek and J. Rokne . Computer Methods for the Range of Functions . Horwood Publishing Limited , Chichester, West Sussex, UK, 1984 . H. Ratschek and J. Rokne. Computer Methods for the Range of Functions. Horwood Publishing Limited, Chichester, West Sussex, UK, 1984."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2003.08.015"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993938"},{"key":"e_1_3_2_1_30_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_31_1","volume-title":"Bulletin (N.S.) of the AMS, 4(1):1--36","author":"Smale S.","year":"1981","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."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/142920.134024"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/38.267467"},{"key":"e_1_3_2_1_35_1","unstructured":"The FRISCO Consortium. FRISCO Polynomial test suite. http:\/\/www-sop.inria.fr\/saga\/POL\/.  The FRISCO Consortium. FRISCO Polynomial test suite. http:\/\/www-sop.inria.fr\/saga\/POL\/."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2005.06.007"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1576702.1576757"},{"key":"e_1_3_2_1_38_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","acronym":"ISSAC '11"},"container-title":["Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2331684.2331710","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2331684.2331710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:50Z","timestamp":1750236530000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2331684.2331710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,7]]},"references-count":37,"alternative-id":["10.1145\/2331684.2331710","10.1145\/2331684"],"URL":"https:\/\/doi.org\/10.1145\/2331684.2331710","relation":{},"subject":[],"published":{"date-parts":[[2012,6,7]]},"assertion":[{"value":"2012-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}