We present a parallel GCD algorithm for sparse multivariate polynomials with integer coefficients. The algorithm combines a Kronecker substitution with a Ben-Or/Tiwari sparse interpolation modulo a smooth prime to determine the support of the GCD. We have implemented our algorithm in C for primes of various size and have parallelized it using Cilk C. We compare our implementation with Maple and Magma's serial implementations of Zippel's GCD algorithm.

中文翻译：

---

快速并行稀疏多项式GCD算法

我们提出了一种具有整数系数的稀疏多元多项式的并行GCD算法。该算法将Kronecker替换与Ben-Or / Tiwari稀疏插值以光滑素数为模的组合来确定GCD的支持。我们已经在C中针对各种大小的素数实现了算法，并使用Cilk C将其并行化。我们将我们的实现与Maple和Magma的Zippel GCD算法的串行实现进行了比较。