{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:59:47Z","timestamp":1760061587754},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030268305"},{"type":"electronic","value":"9783030268312"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26831-2_2","type":"book-chapter","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T23:07:07Z","timestamp":1565824027000},"page":"12-36","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards Soft Exact Computation (Invited Talk)"],"prefix":"10.1007","author":[{"given":"Chee","family":"Yap","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"issue":"1\/2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2644288.2644291","volume":"48","author":"J Abbott","year":"2014","unstructured":"Abbott, J.: Quadratic interval refinement for real roots. ACM Commun. Comput. Algebra 48(1\/2), 3\u201312 (2014). https:\/\/doi.org\/10.1145\/2644288.2644291 . http:\/\/doi.acm.org\/10.1145\/2644288.2644291","journal-title":"ACM Commun. Comput. Algebra"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1111\/1467-8659.1330033","volume":"13","author":"Amitabh Agrawal","year":"1994","unstructured":"Agrawal, A., Requicha, A.: A paradigm for the robust design of algorithms for geometric modeling. In: Computer Graphics Forum, vol. 13, no. 3, pp. 33\u201344 (1994). 15th Annual Conference and Exhibition. EUROGRAPHICS 1994","journal-title":"Computer Graphics Forum"},{"key":"2_CR3","unstructured":"Becker, R.: The Bolzano method to isolate the real roots of a bitstream polynomial. Bachelor thesis, University of Saarland, Saarbruecken, Germany, May 2012"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Becker, R., Sagraloff, M., Sharma, V., Xu, J., Yap, C.: Complexity analysis of root clustering for a complex polynomial. In: 41st International Symposium on Symbolic and Algebraic Computation, iSSAC 2016, Wilfrid Laurier University, Waterloo, Canada, 20\u201322 July, pp. 71\u201378 (2016)","DOI":"10.1145\/2930889.2930939"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jsc.2017.03.009","volume":"86","author":"R Becker","year":"2018","unstructured":"Becker, R., Sagraloff, M., Sharma, V., Yap, C.: A near-optimal subdivision algorithm for complex root isolation based on Pellet test and Newton iteration. J. Symbolic Comput. 86, 51\u201396 (2018)","journal-title":"J. Symbolic Comput."},{"issue":"5","key":"2_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1111\/cgf.12979","volume":"35","author":"H. Bennett","year":"2016","unstructured":"Bennett, H., Papadopoulou, E., Yap, C.: Planar minimization diagrams via subdivision with applications to anisotropic Voronoi diagrams. In: Eurographics Symposium on Geometric Processing, SGP 2016, Berlin, Germany, 20\u201324 June 2016, vol. 35, no. 5 (2016)","journal-title":"Computer Graphics Forum"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.comgeo.2017.02.001","volume":"63","author":"Huck Bennett","year":"2017","unstructured":"Bennett, H., Yap, C.: Amortized analysis of smooth quadtrees in all dimensions. Comput. Geom. Theory Appl. 63, 20\u201339 (2017). Also, in Proceedings SWAT 2014","journal-title":"Computational Geometry"},{"key":"2_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","edition":"3"},{"key":"2_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-33259-6","volume-title":"Effective Computational Geometry for Curves and Surfaces","year":"2007","unstructured":"Boissonnat, J.D., Teillaud, M. (eds.): Effective Computational Geometry for Curves and Surfaces. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-33259-6"},{"key":"2_CR10","unstructured":"Brau\u00dfe, F., et al.: Semantics, logic, and verification of \u201cexact real computation\u201d (2019)"},{"key":"2_CR11","volume-title":"Algorithms for Minimization Without Derivatives","author":"RP Brent","year":"1973","unstructured":"Brent, R.P.: Algorithms for Minimization Without Derivatives. Prentice Hall, Englewood Cliffs (1973)"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.jsc.2011.08.022","volume":"47","author":"M Burr","year":"2012","unstructured":"Burr, M., Krahmer, F.: SqFreeEVAL: an (almost) optimal real-root isolation algorithm. J. Symbolic Comput. 47(2), 153\u2013166 (2012)","journal-title":"J. Symbolic Comput."},{"key":"2_CR13","unstructured":"Burr, M., Krahmer, F., Yap, C.: Continuous amortization: a non-probabilistic adaptive analysis technique. Electronic Colloquium on Computational Complexity (ECCC) TR09(136), December 2009. http:\/\/eccc.hpi-web.de\/report\/2009\/136\/"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.jsc.2016.01.007","volume":"77","author":"MA Burr","year":"2016","unstructured":"Burr, M.A.: Continuous amortization and extensions: with applications to bisection-based root isolation. J. Symb. Comput. 77, 78\u2013126 (2016). https:\/\/doi.org\/10.1016\/j.jsc.2016.01.007","journal-title":"J. Symb. Comput."},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Burr, M.A., Gao, S., Tsigaridas, E.: The complexity of an adaptive subdivision method for approximating real curves. In: 42nd International Symposium on Symbolic and Algebraic Computation (ISSAC), ISSAC 2017, pp. 61\u201368. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3087604.3087654","DOI":"10.1145\/3087604.3087654"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Burr, M.A., Gao, S., Tsigaridas, E.: The complexity of subdivision for diameter-distance tests. J. Symbolic Computation (2019, to appear)","DOI":"10.1016\/j.jsc.2019.06.004"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Cucker, F., Erg\u00fcr, A.A., Tonelli-Cueto, J.: Plantinga-vegter algorithm takes average polynomial time. arXiv:1901.09234 [cs.CG] (2019)","DOI":"10.1145\/3326229.3326252"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1571-0661(04)80378-5","volume":"66","author":"Zilin Du","year":"2002","unstructured":"Du, Z., Eleftheriou, M., Moreira, J., Yap, C.: Hypergeometric functions in exact geometric computation. In: Brattka, V., Schoeder, M., Weihrauch, K. (eds.) Proceedings of 5th Workshop on Computability and Complexity in Analysis, Malaga, Spain, 12\u201313 July 2002, pp. 55\u201366 (2002). In Electronic Notes in Theoretical Computer Science 66:1 (2002). http:\/\/www.elsevier.nl\/locate\/entcs\/volume66.html","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"2_CR19","unstructured":"Du, Z., Yap, C.: Uniform complexity of approximating hypergeometric functions with absolute error. In: Pae, S., Park, H. (eds.) Proceedings of 7th Asian Symposium on Computer Mathematics, ASCM 2005, pp. 246\u2013249 (2006)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Emiris, I.Z., Pan, V.Y., Tsigaridas, E.P.: Algebraic algorithms. In: Gonzalez, T., Diaz-Herrera, J., Tucker, A. (eds.) Computing Handbook: Computer Science and Software Engineering, 3rd edn., pp. 10: 1\u201330. Chapman and Hall\/CRC, Boca Raton (2014)","DOI":"10.1201\/b16812-13"},{"key":"2_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2002)","edition":"2"},{"key":"2_CR22","unstructured":"Hsu, C.H., Chiang, Y.J., Yap, C.: Rods and rings: soft subdivision planner for $${ R}^{3}$$ x $${S}^{2}$$ . In: Proceedings of 35th International Symposium on Computational Geometry, SoCG 2019, 18\u201321 June 2019. CG Week 2019, Portland Oregon. Also in arXiv:1903.09416"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-96418-8_28","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"R Imbach","year":"2018","unstructured":"Imbach, R., Pan, V.Y., Yap, C.: Implementation of a near-optimal complex root clustering algorithm. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 235\u2013244. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96418-8_28"},{"key":"2_CR24","unstructured":"Imbach, R., Pouget, M., Yap, C.: Effective subdivision algorithm for isolating zeros of real systems of equations, with complexity analysis, 21st CASC, Moscow (2019, to appear)"},{"key":"2_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2495-0","volume-title":"Rigorous Global Search: Continuous Problems","author":"RB Kearfott","year":"2013","unstructured":"Kearfott, R.B.: Rigorous Global Search: Continuous Problems, vol. 13. Springer, Dordrecht (2013). https:\/\/doi.org\/10.1007\/978-1-4757-2495-0"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Kerber, M., Sagraloff, M.: Efficient real root approximation. In: Schost, \u00c9., Emiris, I.Z. (eds.) ISSAC, pp. 209\u2013216. ACM (2011)","DOI":"10.1145\/1993886.1993920"},{"key":"2_CR27","volume-title":"Numerical Analysis: Mathematics of Scientific Computing","author":"D Kincaid","year":"2002","unstructured":"Kincaid, D., Cheney, W.: Numerical Analysis: Mathematics of Scientific Computing, 3rd edn. Brooks\/Cole, Boston (2002)","edition":"3"},{"key":"2_CR28","series-title":"Progress in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"KI Ko","year":"1991","unstructured":"Ko, K.I.: Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkh\u00e4user, Boston (1991)"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-662-44199-2_43","volume-title":"Mathematical Software \u2013 ICMS 2014","author":"J-M Lien","year":"2014","unstructured":"Lien, J.-M., Sharma, V., Vegter, G., Yap, C.: Isotopic arrangement of simple curves: an exact numerical approach based on subdivision. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 277\u2013282. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44199-2_43"},{"issue":"4","key":"2_CR30","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1007\/s00454-011-9345-9","volume":"45","author":"L Lin","year":"2011","unstructured":"Lin, L., Yap, C.: Adaptive isotopic approximation of nonsingular curves: the parameterizability and nonlocal isotopy approach. Discrete Comp. Geom. 45(4), 760\u2013795 (2011)","journal-title":"Discrete Comp. Geom."},{"key":"2_CR31","unstructured":"Lin, L., Yap, C., Yu, J.: Non-local isotopic approximation of nonsingular surfaces. Comput. Aided Des. 45(2), 451\u2013462 (2012). Symposium on Solid and Physical Modeling (SPM). U. of Burgundy, Dijon, France, 29\u201331 October 2012"},{"key":"2_CR32","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-7091-6280-4_16","volume-title":"Symbolic Algebraic Methods and Verification Methods","author":"K Mehlhorn","year":"2001","unstructured":"Mehlhorn, K., Schirra, S.: Exact computation with leda\\_real - theory and geometric applications. In: Alefeld, G., Rohn, J., Rump, S., Yamamoto, T. (eds.) Symbolic Algebraic Methods and Verification Methods, pp. 163\u2013172. Springer, Vienna (2001). https:\/\/doi.org\/10.1007\/978-3-7091-6280-4_16"},{"key":"2_CR33","volume-title":"Interval Analysis","author":"RE Moore","year":"1966","unstructured":"Moore, R.E.: Interval Analysis. Prentice Hall, Englewood Cliffs (1966)"},{"key":"2_CR34","unstructured":"\u00d3\u2019D\u00fanlaing, C., Yap, C.K.: A \u201cretraction\u201d method for planning the motion of a disc. J. Algorithms 6, 104\u2013111 (1985). Also, Chapter 6 in Planning, Geometry, and Complexity, eds. Schwartz, Sharir and Hopcroft, Ablex Pub. Corp., Norwood, NJ 1987"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Pedersen, P.: Counting real zeros. In: Proceedings of Conference on Algebraic Algorithms and Error Correcting Codes. LNCS, vol. 539, pp. 318\u2013332. Springer (1991)","DOI":"10.1007\/3-540-54522-0_120"},{"key":"2_CR36","unstructured":"Pedersen, P.: Counting real zeros. Ph.D. thesis, New York University (1991). Also, Courant Institute Computer Science Technical Report 545 (Robotics Report R243)"},{"key":"2_CR37","series-title":"Progress in Mathematics","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-1-4612-2752-6_15","volume-title":"Computational Algebraic Geometry","author":"P Pedersen","year":"1993","unstructured":"Pedersen, P., Roy, M.-F., Szpirglas, A.: Counting real zeros in the multivariate case. In: Eyssette, F., Galligo, A. (eds.) Computational Algebraic Geometry. PM, vol. 109, pp. 203\u2013224. Birkh\u00e4user, Boston (1993). https:\/\/doi.org\/10.1007\/978-1-4612-2752-6_15"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Plantinga, S., Vegter, G.: Isotopic approximation of implicit curves and surfaces. In: Proceedings of Eurographics Symposium on Geometry Processing, pp. 245\u2013254. ACM Press, New York (2004)","DOI":"10.1145\/1057432.1057465"},{"key":"2_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, New York (1985). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6"},{"key":"2_CR40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810763","volume-title":"Mathematical Methods for Physics and Engineering","author":"K Riley","year":"2006","unstructured":"Riley, K., Hopson, M., Bence, S.: Mathematical Methods for Physics and Engineering, 3rd edn. Cambridge University Press, New York (2006)","edition":"3"},{"key":"2_CR41","unstructured":"Sagraloff, M., Yap, C.K.: A simple but exact and efficient algorithm for complex root isolation. In: Emiris, I.Z. (ed.) 36th International Symposium on Symbolic and Algebraic Computing, San Jose, California, 8\u201311 June, pp. 353\u2013360 (2011)"},{"key":"2_CR42","unstructured":"Sagraloff, M., Yap, C.K.: 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:\/\/www.mpi-inf.mpg.de\/~msagralo\/"},{"key":"2_CR43","unstructured":"Schuurman, P., Woeginger, G.: Approximation schemes: a tutorial. In: M\u00f6hring, R., Potts, C., Schulz, A., Woeginger, G., Wolsey, L. (eds.) Lectures in Scheduling (2007, to appear)"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"Sharma, V., Yap, C.: Near optimal tree size bounds on a simple real root isolation algorithm. In: 37th International Symposium on Symbolic and Algebraic Computing, ISSAC 2012, Grenoble, France, 22\u201325 July 2012, pp. 319\u2013326 (2012)","DOI":"10.1145\/2442829.2442875"},{"key":"2_CR45","unstructured":"Sharma, V., Yap, C.K.: Robust geometric computation. In: Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn., chap. 45, pp. 1189\u20131224. Chapman & Hall\/CRC, Boca Raton (2017)"},{"key":"2_CR46","series-title":"Symbolic Shape Design Using Interval Analysis","volume-title":"Generative Modeling for Computer Graphics and CAD","author":"J Snyder","year":"1992","unstructured":"Snyder, J.: Generative Modeling for Computer Graphics and CAD. Symbolic Shape Design Using Interval Analysis. Academic Press Professional Inc., San Diego (1992)"},{"key":"2_CR47","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574","volume-title":"Numerical Linear Algebra","author":"LN Trefethen","year":"1997","unstructured":"Trefethen, L.N., Bau, D.: Numerical Linear Algebra. Society for Industrial and Applied Mathematics, Philadelphia (1997)"},{"key":"2_CR48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59109-9","volume-title":"Numerical Computation 2: Methods, Software, and Analysis","author":"CW Ueberhuber","year":"1997","unstructured":"Ueberhuber, C.W.: Numerical Computation 2: Methods, Software, and Analysis. Springer, Berlin (1997)"},{"issue":"8","key":"2_CR49","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.comgeo.2015.04.002","volume":"48","author":"C Wang","year":"2015","unstructured":"Wang, C., Chiang, Y.J., Yap, C.: On soft predicates in subdivision motion planning. Comput. Geom. Theory Appl. 48(8), 589\u2013605 (2015). (Special Issue for SoCG 2013)","journal-title":"Comput. Geom. Theory Appl."},{"key":"2_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Berlin (2000). https:\/\/doi.org\/10.1007\/978-3-642-56999-9"},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"Xu, J., Yap, C.: Effective subdivision algorithm for isolating zeros of real systems of equations, with complexity analysis. In: 44th International Symposium Symbolic and Algebraic Computing, Beihang University, Beijing, 15\u201318 July (2019)","DOI":"10.1145\/3326229.3326270"},{"key":"2_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-642-39053-1_51","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"C Yap","year":"2013","unstructured":"Yap, C., Sagraloff, M., Sharma, V.: Analytic root clustering: a complete algorithm using soft zero tests. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 434\u2013444. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39053-1_51"},{"key":"2_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-319-19647-3_2","volume-title":"Frontiers in Algorithmics","author":"CK Yap","year":"2015","unstructured":"Yap, C.K.: Soft subdivision search in motion planning, II: axiomatics. In: Wang, J., Yap, C. (eds.) FAW 2015. LNCS, vol. 9130, pp. 7\u201322. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19647-3_2"},{"key":"2_CR54","unstructured":"Yap, C., Luo, Z., Hsu, C.H.: Resolution-exact planner for thick non-crossing 2-link robots. In: Proceedings of 12th International Workshop on Algorithmic Foundations of Robotics, WAFR 2016, San Francisco, 13\u201316 December 2016 (2016). The appendix in the full paper (and arXiv from http:\/\/cs.nyu.edu\/exact\/ (and arXiv:1704.05123 [cs.CG]) contains proofs and additional experimental data"},{"key":"2_CR55","first-page":"322","volume-title":"Lecture Notes Series on Computing","author":"Chee K. Yap","year":"2004","unstructured":"Yap, C.K.: On guaranteed accuracy computation. In: Chen, F., Wang, D. (eds.) Geometric Computation, chap. 12, pp. 322\u2013373. World Scientific Publishing Co., Singapore (2004)"},{"key":"2_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-03456-5_26","volume-title":"Efficient Algorithms","author":"CK Yap","year":"2009","unstructured":"Yap, C.K.: In praise of numerical computation. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 380\u2013407. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03456-5_26"},{"key":"2_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-15582-6_24","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"J Yu","year":"2010","unstructured":"Yu, J., Yap, C., Du, Z., Pion, S., Br\u00f6nnimann, H.: The design of core 2: a library for exact numeric computation in geometry and algebra. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 121\u2013141. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15582-6_24"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26831-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T19:29:31Z","timestamp":1610825371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26831-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030268305","9783030268312"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26831-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.casc.cs.uni-bonn.de\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}