{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T10:10:06Z","timestamp":1755857406126,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T00:00:00Z","timestamp":1690156800000},"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":[[2023,7,24]]},"DOI":"10.1145\/3597066.3597118","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T18:15:27Z","timestamp":1688580927000},"page":"70-79","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Beating binary powering for polynomial matrices"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3798-9281","authenticated-orcid":false,"given":"Alin","family":"Bostan","sequence":"first","affiliation":[{"name":"Inria, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8311-9490","authenticated-orcid":false,"given":"Vincent","family":"Neiger","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, CNRS, LIP6, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9342-4675","authenticated-orcid":false,"given":"Sergey","family":"Yurkevich","sequence":"additional","affiliation":[{"name":"University of Vienna, Austria and Inria, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80159-9"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Alin Bostan Shaoshi Chen Fr\u00e9d\u00e9ric Chyzak and Ziming Li. 2010. Complexity of creative telescoping for bivariate rational functions. In ISSAC\u201910. ACM 203\u2013210. https:\/\/doi.org\/10.1145\/1837934.1837975","DOI":"10.1145\/1837934.1837975"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","unstructured":"Alin Bostan Shaoshi Chen Fr\u00e9d\u00e9ric Chyzak Ziming Li and Guoce Xin. 2013. Hermite reduction and creative telescoping for hyperexponential functions. In ISSAC\u201913. ACM 77\u201384. https:\/\/doi.org\/10.1145\/2465506.2465946","DOI":"10.1145\/2465506.2465946"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","unstructured":"Alin Bostan Fr\u00e9d\u00e9ric Chyzak Pierre Lairez and Bruno Salvy. 2018. Generalized Hermite reduction creative telescoping and definite integration of D-finite functions. In ISSAC\u201918. ACM 95\u2013102. https:\/\/doi.org\/10.1145\/3208976.3208992","DOI":"10.1145\/3208976.3208992"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"Alin Bostan Fr\u00e9d\u00e9ric Chyzak Gr\u00e9goire Lecerf Bruno Salvy and \u00c9ric Schost. 2007. Differential equations for algebraic functions. In ISSAC\u201907. ACM 25\u201332. https:\/\/doi.org\/10.1145\/1277548.1277553","DOI":"10.1145\/1277548.1277553"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Alin Bostan Fr\u00e9d\u00e9ric Chyzak Ziming Li and Bruno Salvy. 2012. Fast computation of common left multiples of linear ordinary differential operators. In ISSAC\u201912. ACM 99\u2013106. https:\/\/doi.org\/10.1145\/2442829.2442847","DOI":"10.1145\/2442829.2442847"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704443793"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Alin Bostan Pierre Lairez and Bruno Salvy. 2013. Creative telescoping for rational functions using the Griffiths-Dwork method. In ISSAC\u201913. ACM 93\u2013100. https:\/\/doi.org\/10.1145\/2465506.2465935","DOI":"10.1145\/2465506.2465935"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976496.14"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/00150517.1963.12431595"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178683"},{"key":"e_1_3_2_1_12_1","volume-title":"Ramanujan revisited (Urbana-Champaign, Ill.","author":"Chudnovsky V.","year":"1987","unstructured":"D.\u00a0V. Chudnovsky and G.\u00a0V. Chudnovsky. 1988. Approximations and complex multiplication according to Ramanujan. In Ramanujan revisited (Urbana-Champaign, Ill., 1987). Academic Press, Boston, MA, 375\u2013472."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00259-9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/2003354"},{"key":"e_1_3_2_1_15_1","first-page":"29","article-title":"D\u00e9composition effective de Jordan-Chevalley","volume":"129","author":"Couty Danielle","year":"2011","unstructured":"Danielle Couty, Jean Esterle, and Rachid Zarouf. 2011. D\u00e9composition effective de Jordan-Chevalley. Gaz. Math.129 (2011), 29\u201349.","journal-title":"Gaz. Math."},{"key":"e_1_3_2_1_16_1","first-page":"23","article-title":"Comparing the computation of Chebyshev polynomials in computer algebra systems","volume":"36","author":"Czirbusz S\u00e1ndor","year":"2012","unstructured":"S\u00e1ndor Czirbusz. 2012. Comparing the computation of Chebyshev polynomials in computer algebra systems. Ann. Univ. Sci. Budapest. Sect. Comput. 36 (2012), 23\u201339.","journal-title":"Ann. Univ. Sci. Budapest. Sect. Comput."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144597319235"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214007"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/274888.274890"},{"key":"e_1_3_2_1_20_1","unstructured":"Henry\u00a0W. Gould. 1972. Combinatorial identities. viii+106 pages. A standardized set of tables listing 500 binomial coefficient summations."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2021.193.2.4"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3505584"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(96)90003-8"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","unstructured":"Seung\u00a0Gyu Hyun Vincent Neiger and \u00c9ric Schost. 2019. Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants. In ISSAC\u201919. ACM 235\u2013242. https:\/\/doi.org\/10.1145\/3326229.3326272","DOI":"10.1145\/3326229.3326272"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371991.3371998"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"Manuel Kauers and Gleb Pogudin. 2017. Bounds for substituting algebraic functions into D-finite functions. In ISSAC\u201917. ACM 245\u2013252. https:\/\/doi.org\/10.1145\/3087604.3087616","DOI":"10.1145\/3087604.3087616"},{"volume-title":"Computer Algebra Systems: A Practical Guide","author":"Koepf Wolfram","key":"e_1_3_2_1_27_1","unstructured":"Wolfram Koepf. 1999. Efficient computation of Chebyshev polynomials in computer algebra. In Computer Algebra Systems: A Practical Guide. Wiley, 79\u201399."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-010-0055-0"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(88)90166-4"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.08.011"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/9.2.188"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(00)00111-7"},{"key":"e_1_3_2_1_33_1","unstructured":"V. Shoup. 2021. NTL: A library for doing number theory v11.5.1. https:\/\/libntl.org."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(80)80051-5"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-020-00413-3"}],"event":{"name":"ISSAC 2023: International Symposium on Symbolic and Algebraic Computation 2023","acronym":"ISSAC 2023","location":"Troms\u00f8 Norway"},"container-title":["Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597066.3597118","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597066.3597118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T09:35:36Z","timestamp":1755855336000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597066.3597118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,24]]},"references-count":35,"alternative-id":["10.1145\/3597066.3597118","10.1145\/3597066"],"URL":"https:\/\/doi.org\/10.1145\/3597066.3597118","relation":{},"subject":[],"published":{"date-parts":[[2023,7,24]]},"assertion":[{"value":"2023-07-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}