线性递归的低复杂度算法
Low Complexity Algorithms for Linear Recurrences
摘要:
我们考虑两类问题:系数为整系数多项式的线性递推方程的多项式和有理解的计算;有理数上超几何序列的不定和定求和。用于这些任务的算法都涉及整数$N$(指数多项式的离差或根)作为中间量,该整数在其输入的比特大小中可能是指数的。先前的算法具有在$N$中至少是二次的位复杂度。我们重新审视它们,并提出利用解决方案的结构,避免扩大多项式的程度$N$的变体。我们给出两个算法:概率型,用于检测$O(\sqrt{N}\log^{2}N)$位操作中非零多项式和有理解的存在与否;确定型,用于计算$O(N\log^{3}N)$位操作中解的紧凑表示。在不定和定超几何求和中得到了类似的加速。我们描述了一个实施的结果。
英文摘要:
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are hypergeometric over the rational numbers. The algorithms for these tasks all involve as an intermediate quantity an integer $N$ (dispersion or root of an indicial polynomial) that is potentially exponential in the bit size of their input. Previous algorithms have a bit complexity that is at least quadratic in $N$. We revisit them and propose variants that exploit the structure of solutions and avoid expanding polynomials of degree $N$. We give two algorithms: a probabilistic one that detects the existence or absence of nonzero polynomial and rational solutions in $O(\sqrt{N}\log^{2}N)$ bit operations; a deterministic one that computes a compact representation of the solution in $O(N\log^{3}N)$ bit operations. Similar speed-ups are obtained in indefinite and definite hypergeometric summation. We describe the results of an implementation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。