{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T04:42:52Z","timestamp":1695530572359},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s11424-019-7361-7","type":"journal-article","created":{"date-parts":[[2019,12,14]],"date-time":"2019-12-14T12:05:02Z","timestamp":1576325102000},"page":"1767-1782","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Logcf: An Efficient Tool for Real Root Isolation"],"prefix":"10.1007","volume":"32","author":[{"given":"Liyun","family":"Dai","sequence":"first","affiliation":[]},{"given":"Zhe","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Bican","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Hanwen","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,14]]},"reference":[{"key":"7361_CR1","volume-title":"Proceedings of the Third ACM Symposium on Symbolic and Algebraic Computation","author":"G Collins","year":"1976","unstructured":"Collins G and Akritas A, Polynomial real roots isolation using descartes' rule of signs, Proceedings of the Third ACM Symposium on Symbolic and Algebraic Computation, New York, 1976."},{"key":"7361_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1145\/2930889.2930937","volume-title":"Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation","author":"A Kobel","year":"2016","unstructured":"Kobel A, Rouillier F, and Sagraloff M, Computing real roots of real polynomials\u2026 and now for real, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, Waterloo, 2016, 303\u2013310."},{"issue":"4","key":"7361_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.cam.2003.08.015","volume":"162","author":"F Rouillier","year":"2004","unstructured":"Rouillier F and Zimmermann P, Efficient isolation of polynomials' real roots, Comput. Math. Appl., 2004, 162(4): 33\u201350.","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"7361_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/3015306.3015317","volume":"50","author":"E Tsigaridas","year":"2016","unstructured":"Tsigaridas E, Slv: A software for real root isolation, ACM Commun. Comput. Algebra, 2016 50(3): 117\u2013120.","journal-title":"ACM Commun. Comput. Algebra"},{"key":"7361_CR5","volume-title":"Real root isolation for exact and approximate polynomials using Descartes' rule of signs","author":"A Eigenwillig","year":"2008","unstructured":"Eigenwillig A, Real root isolation for exact and approximate polynomials using Descartes' rule of signs, PhD thesis, Saarland University, 2008."},{"key":"7361_CR6","first-page":"138","volume-title":"CASC","author":"A Eigenwillig","year":"2005","unstructured":"Eigenwillig A, Kettner L, Krandick W, et al., A descartes algorithm for polynomials with bit-stream coefficients, CASC, Springer, 2005, 138\u2013149."},{"key":"7361_CR7","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jsc.2010.09.004","volume":"46","author":"K Mehlhorn","year":"2011","unstructured":"Mehlhorn K and Sagraloff M, A deterministic algorithm for isolating real roots of a real polynomial, J. Symb. Comput. 2011, 46: 70\u201390.","journal-title":"J. Symb. Comput."},{"issue":"3","key":"7361_CR8","first-page":"365","volume":"13","author":"A Akritas","year":"2008","unstructured":"Akritas A, Strzebonski A, and Vigklas P, Improving the performance of the continued fractions new bounds of positive roots, Nonlinear Analysis: Modelling and Control, 2008, 13(3): 365\u2013279.","journal-title":"Nonlinear Analysis: Modelling and Control"},{"issue":"2","key":"7361_CR9","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.tcs.2008.09.017","volume":"409","author":"V Sharma","year":"2008","unstructured":"Sharma V, Complexity of real root isolation using continued fractions, Theor. Comput. Sci., 2008, 409(2): 292\u2013310.","journal-title":"Theor. Comput. Sci."},{"key":"7361_CR10","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.tcs.2007.10.010","volume":"392","author":"E P Tsigaridas","year":"2008","unstructured":"Tsigaridas E P and Emiris I Z, On the complexity of real root isolation using continued fractions, Theor. Comput. Sci., 2008, 392: 158\u2013173.","journal-title":"Theor. Comput. Sci."},{"key":"7361_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/1577190.1577202","volume-title":"P roceedin gs of the 2009 Conference on Symbolic Numeric Computation","author":"M Hemmer","year":"2009","unstructured":"Hemmer M, Tsigaridas E, Zafeirakopoulos Z, et al., Experimental evaluation and cross-benchmarking of univariate real solvers, P roceedin gs of the 2009 Conference on Symbolic Numeric Computation, ACM, Kyoto, 2009, 45\u201354."},{"key":"7361_CR12","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1016\/j.camwa.2006.06.003","volume":"52","author":"B Xia","year":"2006","unstructured":"Xia B and Zhang T, Real solution isolation using interval arithmetic, Comput. Math. Appl., 2006, 52: 853\u2013860.","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"7361_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s11786-007-0022-6","volume":"1","author":"T Zhang","year":"2007","unstructured":"Zhang T and Xia B, A new method for real root isolation of univariate polynomials, Mathematics in Computer Science, 2007, 1(2): 305\u2013320.","journal-title":"Mathematics in Computer Science"},{"key":"7361_CR14","volume-title":"C++ Toolbox for Verified Scientific Computing - Theory, Algorithms and Programs: Basic Numerical Problems","author":"R Hammer","year":"1995","unstructured":"Hammer R, C++ Toolbox for Verified Scientific Computing - Theory, Algorithms and Programs: Basic Numerical Problems, Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1995."},{"key":"7361_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-94-017-1247-7_7","volume-title":"Developments in Reliable Computing","author":"S Rump","year":"1999","unstructured":"Rump S, INTLAB - Interval Laboratory. Developments in Reliable Computing, Ed. by Csendes T, Kluwer Academic Publishers, Dordrecht, 1999, 77\u2013104. http:\/\/www.ti3.tu-harburg.de\/rump\/."},{"issue":"12","key":"7361_CR16","first-page":"2132","volume":"11","author":"D \u015etef\u0103nescu","year":"2005","unstructured":"\u015etef\u0103nescu D, New bounds for the positive roots of polynomials, J. Universal Comput. Sci. 2005, 11(12): 2132\u20132141.","journal-title":"J. Universal Comput. Sci."},{"issue":"5","key":"7361_CR17","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1006\/jsco.1997.0189","volume":"25","author":"H Hong","year":"1998","unstructured":"Hong H, Bounds for absolute positiveness of multivariate polynomials, J. Symb. Comput., 1998, 25(5): 571\u2013585.","journal-title":"J. Symb. Comput."},{"key":"7361_CR18","volume-title":"Lecture Notes in Computer Science","author":"J Gerhard","year":"2004","unstructured":"Gerhard J, Modular algorithms in symbolic summation and symbolic integration, Lecture Notes in Computer Science, Springer Press, 2004."},{"key":"7361_CR19","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/1073884.1073913","volume-title":"ISSAC","author":"J R Johnson","year":"2005","unstructured":"Johnson J R, Krandick W, and Ruslanov A D, Architecture-aware classical taylor shift by 1, ISSAC, ACM, Beijing, 2005, 200\u2013207."},{"key":"7361_CR20","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1145\/1145768.1145797","volume-title":"ISSAC","author":"J R Johnson","year":"2006","unstructured":"Johnson J R, Krandick W, Richardson D, et al., High-performance implementations of the descartes method, ISSAC ACM, Genoa, 2006, 154\u2013161."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-019-7361-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-019-7361-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-019-7361-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T00:19:08Z","timestamp":1695514748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-019-7361-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["7361"],"URL":"https:\/\/doi.org\/10.1007\/s11424-019-7361-7","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"1 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}