{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T07:44:26Z","timestamp":1772264666217,"version":"3.50.1"},"reference-count":88,"publisher":"Association for Computing Machinery (ACM)","issue":"1","funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-20-CE48-0014"],"award-info":[{"award-number":["ANR-20-CE48-0014"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2026,1,31]]},"abstract":"<jats:p>The goal of this article is to give a survey on the various computational and mathematical issues and progress related to the problem of providing efficient correctly rounded elementary functions in floating-point arithmetic. We also aim at convincing the reader that a future standard for floating-point arithmetic should require the availability of a correctly rounded version of a well-chosen core set of elementary functions. We discuss the interest and feasibility of this requirement.<\/jats:p>","DOI":"10.1145\/3747840","type":"journal-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T06:08:41Z","timestamp":1751954921000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Correctly Rounded Evaluation of a Function: Why, How, and at What Cost?"],"prefix":"10.1145","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4220-2132","authenticated-orcid":false,"suffix":"PhD","given":"Nicolas","family":"Brisebarre","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Lyon, CNRS, ENS de Lyon, Inria, Universit\u00e9 Claude-Bernard Lyon, 1, Laboratoire LIP (UMR 5668)","place":["Lyon, France"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9319-0365","authenticated-orcid":false,"given":"Guillaume","family":"Hanrot","sequence":"additional","affiliation":[{"name":"Cryptolab, Inc. & Universit\u00e9 de Lyon, CNRS, ENS de Lyon, Inria, Universit\u00e9 Claude-Bernard Lyon 1, Laboratoire LIP (UMR 5668)","place":["Lyon, France"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3588-0047","authenticated-orcid":false,"given":"Jean-Michel","family":"Muller","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lyon, CNRS, ENS de Lyon, Inria, Universit\u00e9 Claude-Bernard Lyon, 1, Laboratoire LIP (UMR 5668)","place":["Lyon, France"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0718-4458","authenticated-orcid":false,"given":"Paul","family":"Zimmermann","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lorraine, CNRS","place":["Inria, France"]}]}],"member":"320","published-online":{"date-parts":[[2025,9,4]]},"reference":[{"key":"e_1_3_4_2_2","doi-asserted-by":"publisher","unstructured":"D. H. Ahn A. H. Baker M. Bentley I. Briggs G. Gopalakrishnan D. M. Hammerling I. Laguna G. L. Lee D. J. Milroy and M. Vertenstein. 2021. Keeping science on keel when software moves. Communications of the ACM 64 2 (2021) 66\u201374. DOI:10.1145\/3382037","DOI":"10.1145\/3382037"},{"key":"e_1_3_4_3_2","doi-asserted-by":"publisher","unstructured":"P. Ahrens J. Demmel and H. D. Nguyen. 2020. Algorithms for efficient reproducible floating point summation. ACM Transactions on Mathematical Software 46 3 (2020) 49 pages. DOI:10.1145\/3389360","DOI":"10.1145\/3389360"},{"key":"e_1_3_4_4_2","doi-asserted-by":"publisher","DOI":"10.5555\/3169576"},{"key":"e_1_3_4_5_2","doi-asserted-by":"crossref","unstructured":"V. Berth\u00e9 and L. Imbert. 2009. Diophantine approximation Ostrowski numeration and the double-base number system. Discrete Mathematics and Theoretical Computer Science 11 1 (2009) 153\u2013172. Retrieved from http:\/\/dmtcs.episciences.org\/450","DOI":"10.46298\/dmtcs.450"},{"key":"e_1_3_4_6_2","doi-asserted-by":"crossref","unstructured":"C. M. Black R. P. Burton and T. H. Miller. 1984. The need for an industry standard of accuracy for elementary-function programs. ACM Transactions on Mathematical Software 10 4 (1984) 361\u2013366.","DOI":"10.1145\/2701.356101"},{"key":"e_1_3_4_7_2","doi-asserted-by":"publisher","unstructured":"S. Boldo M. Daumas and R.-C. Li. 2009. Formally verified argument reduction with a fused multiply-add. IEEE Transactions on Computers 58 8 (2009) 1139\u20131145. DOI:10.1109\/TC.2008.216","DOI":"10.1109\/TC.2008.216"},{"key":"e_1_3_4_8_2","doi-asserted-by":"publisher","unstructured":"S. Boldo C.-P. Jeannerod G. Melquiond and J.-M. Muller. 2023. Floating-point arithmetic. Acta Numerica 32 (2023) 203\u2013290. DOI:10.1017\/S0962492922000101","DOI":"10.1017\/S0962492922000101"},{"key":"e_1_3_4_9_2","unstructured":"N. Brisebarre and G. Hanrot. 2023. Integer points close to a transcendental curve and correctly-rounded evaluation of a function. (2023). Retrieved 16 July 2025 from https:\/\/hal.science\/hal-03240179. Working paper or preprint."},{"key":"e_1_3_4_10_2","doi-asserted-by":"publisher","unstructured":"N. Brisebarre G. Hanrot and O. Robert. 2017. Exponential sums and correctly-rounded functions. IEEE Transactions on Computers 66 12 (2017) 2044\u20132057. DOI:10.1109\/TC.2017.2690850","DOI":"10.1109\/TC.2017.2690850"},{"key":"e_1_3_4_11_2","doi-asserted-by":"publisher","unstructured":"N. Brisebarre and J.-M. Muller. 2007. Correct rounding of algebraic functions. Theoretical Informatics and Applications-Informatique Th\u00e9orique et Applications 41 1 (2007) 71\u201383. DOI:10.1051\/ita:2007002","DOI":"10.1051\/ita:2007002"},{"key":"e_1_3_4_12_2","doi-asserted-by":"publisher","unstructured":"N. Brisebarre and J.-M. Muller. 2008. Correctly rounded multiplication by arbitrary precision constants. IEEE Transactions on Computers 57 2 (2008) 165\u2013174. DOI:10.1109\/TC.2007.70813","DOI":"10.1109\/TC.2007.70813"},{"key":"e_1_3_4_13_2","volume-title":"Programming Languages \u2013 C, Working draft","author":"Group C Working","year":"2024","unstructured":"C Working Group. 2024. Programming Languages \u2013 C, Working draft. Retrieved 16 July 2025 from https:\/\/www.open-std.org\/jtc1\/sc22\/wg14\/www\/docs\/n3435.pdf"},{"key":"e_1_3_4_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15582-6_5"},{"key":"e_1_3_4_15_2","volume-title":"Software Manual for the Elementary Functions","author":"Cody W.","year":"1980","unstructured":"W. Cody and W. Waite. 1980. Software Manual for the Elementary Functions. Prentice-Hall, Englewood Cliffs, NJ."},{"key":"e_1_3_4_16_2","first-page":"171","volume-title":"Proceedings of the Mathematical Software.","author":"Cody W. J.","year":"1971","unstructured":"W. J. Cody. 1971. Software for the elementary functions. In Proceedings of the Mathematical Software.John R. Rice (Ed.). Academic Press, 171\u2013186."},{"key":"e_1_3_4_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/648091.747640"},{"key":"e_1_3_4_18_2","doi-asserted-by":"publisher","unstructured":"D. Coppersmith. 1997. Small solutions to polynomial equations and low exponent RSA vulnerabilities. Journal of Cryptology 10 4 (1997) 233\u2013260. DOI:10.1007\/s001459900030","DOI":"10.1007\/s001459900030"},{"key":"e_1_3_4_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44670-2_3"},{"key":"e_1_3_4_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2003.1207666"},{"key":"e_1_3_4_21_2","doi-asserted-by":"publisher","DOI":"10.1117\/12.505591"},{"key":"e_1_3_4_22_2","volume-title":"CR-LIBM, A Library of Correctly-rounded Elementary Functions in Double-precision","author":"Daramy-Loirat C.","year":"2006","unstructured":"C. Daramy-Loirat, D. Defour, F. de Dinechin, M. Gallet, N. Gast, C. Q. Lauter, and J.-M. Muller. 2006. CR-LIBM, A Library of Correctly-rounded Elementary Functions in Double-precision. Technical Report. LIP Laboratory, Arenaire team, Retrieved from https:\/\/ens-lyon.hal.science\/ensl-01529804\/file\/crlibm.pdf"},{"key":"e_1_3_4_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2005.46"},{"key":"e_1_3_4_24_2","doi-asserted-by":"publisher","unstructured":"F. de Dinechin C. Lauter and G. Melquiond. 2011. Certifying the floating-point implementation of an elementary function using Gappa. IEEE Transactions on Computers 60 2 (2011) 242\u2013253. DOI:10.1109\/TC.2010.128","DOI":"10.1109\/TC.2010.128"},{"key":"e_1_3_4_25_2","doi-asserted-by":"publisher","unstructured":"F. de Dinechin C. Lauter and J.-M. Muller. 2007. Fast and correctly rounded logarithms in double-precision. Theoretical Informatics and Applications 41 1 (2007) 85\u2013102. DOI:10.1051\/ita:2007003","DOI":"10.1051\/ita:2007003"},{"key":"e_1_3_4_26_2","doi-asserted-by":"publisher","unstructured":"F. de Dinechin C. Lauter J.-M. Muller and S. Torres. 2013. On Ziv\u2019s Rounding Test. ACM Transactions on Mathematical Software 39 4 (2013) 19 pages. DOI:10.1145\/2491491.2491495","DOI":"10.1145\/2491491.2491495"},{"key":"e_1_3_4_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2011.6043267"},{"key":"e_1_3_4_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH58626.2023.00026"},{"key":"e_1_3_4_29_2","volume-title":"Fonctions \u00e9l\u00e9mentaires: algorithmes et impl\u00e9mentations efficaces pour l\u2019arrondi correct en double pr\u00e9cision","author":"Defour D.","year":"2003","unstructured":"D. Defour. 2003. Fonctions \u00e9l\u00e9mentaires: algorithmes et impl\u00e9mentations efficaces pour l\u2019arrondi correct en double pr\u00e9cision. Ph.D. Dissertation. \u00c9cole normale sup\u00e9rieure de Lyon, Lyon, France. Retrieved from http:\/\/www.ens-lyon.fr\/LIP\/Pub\/Rapports\/PhD\/PhD2003\/PhD2003-01.ps.gz"},{"key":"e_1_3_4_30_2","volume-title":"Proceedings of the 46th Annual Meeting International Symposium on Optical Science and Technology","author":"Defour D.","year":"2001","unstructured":"D. Defour and J.-M. Muller. 2001. Correctly rounded exponential function in double precision arithmetic. In Proceedings of the 46th Annual Meeting International Symposium on Optical Science and Technology."},{"key":"e_1_3_4_31_2","doi-asserted-by":"crossref","unstructured":"C. B. Dunham. 1990. Feasibility of \u201cPerfect\u201d function evaluation. SIGNUM Newsletter 25 4 (1990) 25\u201326.","DOI":"10.1145\/122272.122276"},{"key":"e_1_3_4_32_2","first-page":"33","volume-title":"Proceedings of the Western Joint Computing Conference","author":"Estrin G.","year":"1960","unstructured":"G. Estrin. 1960. Organization of computer systems \u2013 the fixed plus variable structure computer. In Proceedings of the Western Joint Computing Conference. 33\u201340."},{"key":"e_1_3_4_33_2","doi-asserted-by":"publisher","unstructured":"N. Fabiano J.-M. Muller and J. Picot. 2019. Algorithms for triple-word arithmetic. IEEE Transactions on Computers 68 11 (2019) 1573\u20131583. DOI:10.1109\/TC.2019.2918451","DOI":"10.1109\/TC.2019.2918451"},{"key":"e_1_3_4_34_2","unstructured":"N. I. Fel\u2019dman. 1971. An effective power sharpening of a theorem of Liouville. Izv. Akad. Nauk SSSR Ser. Mat. 35 (1971) 973\u2013990."},{"key":"e_1_3_4_35_2","doi-asserted-by":"publisher","unstructured":"L. Fousse G. Hanrot V. Lef\u00e8vre P. P\u00e9lissier and P. Zimmermann. 2007. MPFR: A multiple-precision binary floating-point library with correct rounding. ACM Transactions on Mathematical Software 33 2 (2007) 1\u201315. DOI:10.1145\/1236463.1236468","DOI":"10.1145\/1236463.1236468"},{"key":"e_1_3_4_36_2","doi-asserted-by":"crossref","unstructured":"S. Gal and B. Bachelis. 1991. An accurate elementary mathematical library for the IEEE floating point standard. ACM Transactions on Mathematical Software 17 1 (1991) 26\u201345.","DOI":"10.1145\/103147.103151"},{"key":"e_1_3_4_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9981-5_4"},{"key":"e_1_3_4_38_2","unstructured":"B. Gladman V. Innocente J. Mather and P. Zimmermann. 2025. Accuracy of mathematical functions in single double extended double and quadruple precision. (2025). Working paper or preprint Retrieved 16 July 2025 from https:\/\/hal.inria.fr\/hal-03141101"},{"key":"e_1_3_4_39_2","doi-asserted-by":"crossref","unstructured":"D. Goldberg. 1991. What every computer scientist should know about floating-point arithmetic. Computing Surveys 23 1 (1991) 5\u201348.","DOI":"10.1145\/103162.103163"},{"key":"e_1_3_4_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2007.37"},{"key":"e_1_3_4_41_2","unstructured":"G. Hanrot V. Lef\u00e8vre D. Stehl\u00e9 and P. Zimmermann. 2020. BaCSeL. Retrieved 16 July 2025 from https:\/\/gitlab.inria.fr\/zimmerma\/bacsel (2020). Version 4.0."},{"key":"e_1_3_4_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH58626.2023.00028"},{"key":"e_1_3_4_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2019.8766229"},{"key":"e_1_3_4_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1999.762849"},{"key":"e_1_3_4_45_2","doi-asserted-by":"publisher","unstructured":"M. Joldes J.-M. Muller and V. Popescu. 2017. Tight and rigorous error bounds for basic building blocks of double-word arithmetic. ACM Trans. Math. Software 44 2 (2017) 1\u201327. DOI:10.1145\/3121432","DOI":"10.1145\/3121432"},{"key":"e_1_3_4_46_2","volume-title":"Why do we Need a Floating-Point Standard?","author":"Kahan W.","year":"1981","unstructured":"W. Kahan. 1981. Why do we Need a Floating-Point Standard?Technical Report. Computer Science, UC Berkeley. Retrieved 16 July 2025 from https:\/\/www.cs.berkeley.edu\/wkahan\/ieee754status\/why-ieee.pdf"},{"key":"e_1_3_4_47_2","unstructured":"W. Kahan. 1983. Minimizing \\(qm-n\\) . Text accessible electronically at Retrieved 16 July 2025 from https:\/\/people.eecs.berkeley.edu\/wkahan\/testpi\/nearpi.c. (1983). At the beginning of the file \u201cnearpi.c\u201d."},{"key":"e_1_3_4_48_2","unstructured":"W. Kahan. 2004. A Logarithm Too Clever by Half. (2004). Retrieved 16 July 2025 from https:\/\/people.eecs.berkeley.edu\/wkahan\/LOG10HAF.TXT"},{"key":"e_1_3_4_49_2","unstructured":"S. Kh\u00e9mira and P. Voutier. 2011. Approximation diophantienne et approximants de Hermite-Pad\u00e9 de type I de fonctions exponentielles. Annales Math\u00e9matiques du Qu\u00e9bec 35 1 (2011) 85\u2013116."},{"key":"e_1_3_4_50_2","volume-title":"Approximants de Hermite-Pad\u00e9, D\u00e9terminants d\u2019interpolation et Approximation Diophantienne","author":"Kh\u00e9mira S.","year":"2005","unstructured":"S. Kh\u00e9mira. 2005. Approximants de Hermite-Pad\u00e9, D\u00e9terminants d\u2019interpolation et Approximation Diophantienne. Ph.D. Dissertation. Universit\u00e9 Paris 6, Paris, France. Retrieved from https:\/\/hal.science\/tel-00009653"},{"key":"e_1_3_4_51_2","doi-asserted-by":"publisher","unstructured":"P. Kornerup C. Lauter V. Lef\u00e8vre N. Louvet and J.-M. Muller. 2010. Computing correctly rounded integer powers in floating-point arithmetic. ACM Transactions on Mathematical Software 37 1 (2010) 4:1\u20134:23. DOI:10.1145\/1644001.1644005","DOI":"10.1145\/1644001.1644005"},{"key":"e_1_3_4_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44199-2_106"},{"key":"e_1_3_4_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2001.930099"},{"key":"e_1_3_4_54_2","volume-title":"Arrondi Correct de Fonctions Math\u00e9matiques","author":"Lauter C. Q.","year":"2008","unstructured":"C. Q. Lauter. 2008. Arrondi Correct de Fonctions Math\u00e9matiques. Ph.D. Dissertation. \u00c9cole Normale Sup\u00e9rieure de Lyon, Lyon, France. Retrieved from https:\/\/www.christoph-lauter.org\/these.pdf"},{"key":"e_1_3_4_55_2","doi-asserted-by":"crossref","unstructured":"C. Q. Lauter and V. Lef\u00e8vre. 2009. An efficient rounding boundary test for pow \\((x y)\\) in double precision. IEEE Transactions on Computers 58 2 (2009) 197\u2013207.","DOI":"10.1109\/TC.2008.202"},{"key":"e_1_3_4_56_2","volume-title":"Moyens Arithm\u00e9tiques Pour un Calcul Fiable","author":"Lef\u00e8vre V.","year":"2000","unstructured":"V. Lef\u00e8vre. 2000. Moyens Arithm\u00e9tiques Pour un Calcul Fiable. Ph.D. Dissertation. \u00c9cole Normale Sup\u00e9rieure de Lyon, Lyon, France."},{"key":"e_1_3_4_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2005.32"},{"key":"e_1_3_4_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2001.930110"},{"key":"e_1_3_4_59_2","doi-asserted-by":"crossref","unstructured":"V. Lef\u00e8vre J.-M. Muller and A. Tisserand. 1998. Toward correctly rounded transcendentals. IEEE Transactions on Computers 47 11 (1998) 1235\u20131243.","DOI":"10.1109\/12.736435"},{"key":"e_1_3_4_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454049"},{"key":"e_1_3_4_61_2","doi-asserted-by":"publisher","unstructured":"J. P. Lim and S. Nagarakatte. 2022. One polynomial approximation to produce correctly rounded results of an elementary function for multiple representations and rounding modes. Proceedings of the ACM on Programming Languages 6 POPL (2022) 1\u201328. DOI:10.1145\/3498664","DOI":"10.1145\/3498664"},{"key":"e_1_3_4_62_2","doi-asserted-by":"publisher","unstructured":"S. Linnainmaa. 1981. Software for doubled-precision floating-point computations. ACM Transactions on Mathematical Software 7 3 (1981) 272\u2013283. DOI:10.1145\/355958.355960","DOI":"10.1145\/355958.355960"},{"key":"e_1_3_4_63_2","unstructured":"J. Liouville. 1844. Nouvelle d\u00e9monstration d\u2019un th\u00e9or\u00e8me sur les irrationnelles alg\u00e9briques. C. R. Acad. Sci. Paris 18 (1844) 910\u2013911."},{"key":"e_1_3_4_64_2","unstructured":"J. Liouville. 1844. Remarques relatives \u00e0 des classes tr\u00e8s-\u00e9tendues de quantit\u00e9s dont la valeur n\u2019est ni alg\u00e9brique ni m\u00eame r\u00e9ductible \u00e0 des irrationnelles alg\u00e9briques. C. R. Acad. Sci. Paris 18 (1844) 883\u2013885."},{"key":"e_1_3_4_65_2","unstructured":"J. Liouville. 1851. Sur des classes tr\u00e8s \u00e9tendues de quantit\u00e9s dont la valeur n\u2019est ni alg\u00e9brique ni m\u00eame r\u00e9ductible \u00e0 des irrationnelles alg\u00e9briques. Journal de Math\u00e9matiques Pures et Appliqu\u00e9es 16 (1851) 133\u2013142."},{"key":"e_1_3_4_66_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2016.24"},{"key":"e_1_3_4_67_2","volume-title":"IA-64 and Elementary Functions: Speed and Precision","author":"Markstein P.","year":"2000","unstructured":"P. Markstein. 2000. IA-64 and Elementary Functions: Speed and Precision. Prentice-Hall, Englewood Cliffs, NJ."},{"key":"e_1_3_4_68_2","doi-asserted-by":"publisher","unstructured":"\u00c9. Martin-Dorel G. Hanrot M. Mayero and L. Th\u00e9ry. 2015. Formally verified certificate checkers for hardest-to-round computation. Journal of Automated Reasoning 54 1 (2015) 1\u201329. DOI:10.1007\/s10817-014-9312-2","DOI":"10.1007\/s10817-014-9312-2"},{"key":"e_1_3_4_69_2","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-8159-6_3"},{"key":"e_1_3_4_70_2","doi-asserted-by":"publisher","unstructured":"J.-M. Muller and L. Rideau. 2022. Formalization of double-word arithmetic and comments on \u201cTight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic\u201d. ACM Transactions on Mathematical Software 48 1 (2022) 9:1\u20139:24. DOI:10.1145\/3484514","DOI":"10.1145\/3484514"},{"key":"e_1_3_4_71_2","volume-title":"Elementary Functions, Algorithms and Implementation (3rd. ed.)","author":"Muller J.-M.","year":"2016","unstructured":"J.-M. Muller. 2016. Elementary Functions, Algorithms and Implementation (3rd. ed.). Birkh\u00e4user, Boston."},{"key":"e_1_3_4_72_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4705-6"},{"key":"e_1_3_4_73_2","doi-asserted-by":"publisher","DOI":"10.5555\/3235984"},{"key":"e_1_3_4_74_2","unstructured":"Y. V. Nesterenko and M. Waldschmidt. 1996. On the approximation of the values of exponential function and logarithm by algebraic numbers (in Russian). Mat. Zapiski 2 (1996) 23\u201342. Available in English at arXiv:0002047. Retrieved from https:\/\/arxiv.org\/abs\/math\/0002047"},{"key":"e_1_3_4_75_2","doi-asserted-by":"publisher","DOI":"10.5555\/376366"},{"key":"e_1_3_4_76_2","doi-asserted-by":"crossref","unstructured":"G. Paul and M. W. Wilson. 1976. Should the elementary function library be incorporated into computer instruction sets? ACM Transactions on Mathematical Software 2 2 (1976) 132\u2013142.","DOI":"10.1145\/355681.355684"},{"key":"e_1_3_4_77_2","doi-asserted-by":"publisher","unstructured":"D. Piparo and V. Innocente. 2016. The CptnHook Profiler - A tool to investigate usage patterns of mathematical functions. Journal of Physics: Conference Series 762 (2016) 012038. DOI:10.1088\/1742-6596\/762\/1\/012038","DOI":"10.1088\/1742-6596\/762\/1\/012038"},{"key":"e_1_3_4_78_2","doi-asserted-by":"publisher","unstructured":"D. Ridout. 1957. Rational approximations to algebraic numbers. Mathematika 4 (1957) 125\u2013131. DOI:10.1112\/S0025579300001182","DOI":"10.1112\/S0025579300001182"},{"key":"e_1_3_4_79_2","doi-asserted-by":"crossref","unstructured":"K. F. Roth. 1955. Rational approximations to algebraic numbers. Mathematika 2 (1955) 1\u201320.","DOI":"10.1112\/S0025579300000644"},{"key":"e_1_3_4_80_2","doi-asserted-by":"publisher","unstructured":"S. M. Rump. 2010. Verification methods: Rigorous results using floating-point arithmetic. Acta Numer. 19 (2010) 287\u2013449. DOI:10.1017\/S096249291000005X","DOI":"10.1017\/S096249291000005X"},{"key":"e_1_3_4_81_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1993.378099"},{"key":"e_1_3_4_82_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH54963.2022.00014"},{"key":"e_1_3_4_83_2","doi-asserted-by":"crossref","unstructured":"R. A. Smith. 1995. A Continued-fraction analysis of trigonometric argument reduction. IEEE Transactions on Computers 44 11 (1995) 1348\u20131351.","DOI":"10.1109\/12.475133"},{"key":"e_1_3_4_84_2","doi-asserted-by":"publisher","DOI":"10.1007\/11792086_19"},{"key":"e_1_3_4_85_2","doi-asserted-by":"crossref","unstructured":"D. Stehl\u00e9 V. Lef\u00e8vre and P. Zimmermann. 2005. Searching worst cases of a one-variable function using lattice reduction. IEEE Transactions on Computers 54 3 (2005) 340\u2013346.","DOI":"10.1109\/TC.2005.55"},{"key":"e_1_3_4_86_2","volume-title":"Tools for the Design of Reliable and Efficient Functions Evaluation Libraries","author":"Torres S.","year":"2016","unstructured":"S. Torres. 2016. Tools for the Design of Reliable and Efficient Functions Evaluation Libraries. Ph.D. Dissertation. \u00c9cole normale sup\u00e9rieure de Lyon \u2013 Universit\u00e9 de Lyon, Lyon, France. Retrieved from https:\/\/tel.archives-ouvertes.fr\/tel-01396907"},{"key":"e_1_3_4_87_2","volume-title":"Extension of the SLZ Algorithm to Bivariate Functions","author":"Turelier L.","year":"2022","unstructured":"L. Turelier. 2022. Extension of the SLZ Algorithm to Bivariate Functions. Research Report. INRIA Nancy. Retrieved from https:\/\/inria.hal.science\/hal-03740209"},{"key":"e_1_3_4_88_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-11569-5"},{"key":"e_1_3_4_89_2","doi-asserted-by":"crossref","unstructured":"A. Ziv. 1991. Fast evaluation of elementary mathematical functions with correctly rounded last bit. ACM Transactions on Mathematical Software 17 3 (1991) 410\u2013423.","DOI":"10.1145\/114697.116813"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3747840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T10:13:09Z","timestamp":1769508789000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3747840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,4]]},"references-count":88,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1,31]]}},"alternative-id":["10.1145\/3747840"],"URL":"https:\/\/doi.org\/10.1145\/3747840","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,4]]},"assertion":[{"value":"2024-05-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}