Modular composition is the problem of computing the coefficient vector of the polynomial $f(g(x)) \bmod h(x)$, given as input the coefficient vectors of univariate polynomials $f$, $g$, and $h$ over an underlying field $\mathbb{F}$. While this problem is known to be solvable in nearly-linear time over finite fields due to work of Kedlaya & Umans, no such near-linear-time algorithms are known over infinite fields, with the fastest known algorithm being from a recent work of Neiger, Salvy, Schost & Villard that takes $O(n^{1.43})$ field operations on inputs of degree $n$. In this work, we show that for any infinite field $\mathbb{F}$, modular composition is in the border of algebraic circuits with division gates of nearly-linear size and polylogarithmic depth. Moreover, this circuit family can itself be constructed in near-linear time. Our techniques also extend to other algebraic problems, most notably to the problem of computing greatest common divisors of univariate polynomials. We show that over any infinite field $\mathbb{F}$, the GCD of two univariate polynomials can be computed (piecewise) in the border sense by nearly-linear-size and polylogarithmic-depth algebraic circuits with division gates, where the circuits themselves can be constructed in near-linear time. While univariate polynomial GCD is known to be computable in near-linear time by the Knuth--Schönhage algorithm, or by constant-depth algebraic circuits from a recent result of Andrews & Wigderson, obtaining a parallel algorithm that simultaneously achieves polylogarithmic depth and near-linear work remains an open problem of great interest. Our result shows such an upper bound in the setting of border complexity.

翻译：模组合问题旨在计算多项式$f(g(x)) \\bmod h(x)$的系数向量，其输入为定义在域$\\mathbb{F}$上的单变量多项式$f$、$g$和$h$的系数向量。尽管Kedlaya与Umans的研究表明该问题在有限域上可在近线性时间内求解，但在无限域上尚未发现类似的近线性时间算法；目前最快的算法来自Neiger、Salvy、Schost与Villard的最新工作，其对于次数为$n$的输入需要$O(n^{1.43})$次域运算。本研究表明，对于任意无限域$\\mathbb{F}$，模组合问题属于具有除法门的近线性规模与多对数深度的代数电路的边界复杂度类。此外，该电路族本身可在近线性时间内构造。我们的技术还可扩展至其他代数问题，最显著的是单变量多项式最大公约数的计算。我们证明，在任意无限域$\\mathbb{F}$上，两个单变量多项式的最大公约数可通过具有除法门的近线性规模与多对数深度的代数电路以边界意义（分段）计算，且这些电路本身可在近线性时间内构造。尽管Knuth--Schönhage算法或Andrews与Wigderson近期成果中的常数深度代数电路已知可在近线性时间内计算单变量多项式最大公约数，但实现多对数深度与近线性工作量并行的算法仍是备受关注的开问题。我们的结果在边界复杂度框架下给出了此类上界。