{"title":"Power Series Composition in Near-Linear Time","authors":"Yasunori Kinoshita, Baitian Li","doi":"arxiv-2404.05177","DOIUrl":null,"url":null,"abstract":"We present an algebraic algorithm that computes the composition of two power\nseries in $\\mathop{\\tilde{\\mathrm O}}(n)$ time complexity. The previous best\nalgorithms are $\\mathop{\\mathrm O}(n^{1+o(1)})$ by Kedlaya and Umans (FOCS\n2008) and an $\\mathop{\\mathrm O}(n^{1.43})$ algebraic algorithm by Neiger,\nSalvy, Schost and Villard (JACM 2023). Our algorithm builds upon the recent Graeffe iteration approach to manipulate\nrational power series introduced by Bostan and Mori (SOSA 2021).","PeriodicalId":501033,"journal":{"name":"arXiv - CS - Symbolic Computation","volume":"117 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Symbolic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2404.05177","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We present an algebraic algorithm that computes the composition of two power
series in $\mathop{\tilde{\mathrm O}}(n)$ time complexity. The previous best
algorithms are $\mathop{\mathrm O}(n^{1+o(1)})$ by Kedlaya and Umans (FOCS
2008) and an $\mathop{\mathrm O}(n^{1.43})$ algebraic algorithm by Neiger,
Salvy, Schost and Villard (JACM 2023). Our algorithm builds upon the recent Graeffe iteration approach to manipulate
rational power series introduced by Bostan and Mori (SOSA 2021).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
