基于离散傅里叶变换的快速多项式乘法
Faster Polynomial Multiplication via Discrete Fourier Transforms
摘要:
研究了任意域上多项式乘法的复杂性。我们提出了一个统一的方法,概括了所有已知的渐近最快的算法,这个问题。特别是,著名的算法乘法多项式的领域支持DFT的大光滑的订单,Schönhage-Strassen的算法在任意领域的特点不同2,Schönhage的算法在领域的特点2,和康托-Kaltofen的算法在任意代数-都似乎是这种方法的实例。我们还获得了更快的算法多项式乘法在某些领域不支持DFT的大光滑订单。我们证明,Schönhage-Strassen的上限不能进一步提高有理数领域,如果我们只考虑算法的基础上连续应用DFT,所有已知的最快的算法。我们还探讨了如何将最近的整数乘法的Fürer算法转移到正特征的任意域上的多项式乘法问题。这项工作的灵感来自最近的改进密切相关的问题的复杂性整数乘法的傅勒及其随之而来的模块化算术处理由于德,Kurur,萨哈,和Saptharishi。我们探讨的障碍,在转移技术的解决方案的一个问题的解决方案的其他。
英文摘要:
We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem. In particular, the well-known algorithm for multiplication of polynomials over fields supporting DFTs of large smooth orders, Schönhage-Strassen's algorithm over arbitrary fields of characteristic different from 2, Schönhage's algorithm over fields of characteristic 2, and Cantor-Kaltofen's algorithm over arbitrary algebras---all appear to be instances of this approach. We also obtain faster algorithms for polynomial multiplication over certain fields which do not support DFTs of large smooth orders. We prove that the Schönhage-Strassen's upper bound cannot be improved further over the field of rational numbers if we consider only algorithms based on consecutive applications of DFT, as all known fastest algorithms are. We also explore the ways to transfer the recent Fürer's algorithm for integer multiplication to the problem of polynomial multiplication over arbitrary fields of positive characteristic. This work is inspired by the recent improvement for the closely related problem of complexity of integer multiplication by Fürer and its consequent modular arithmetic treatment due to De, Kurur, Saha, and Saptharishi. We explore the barriers in transferring the techniques for solutions of one problem to a solution of the other.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。