This article does not introduce new mathematical ideas, it is more a state of the art June 2021 picture about solving polynomial systems efficiently by reconstructing a rational univariate representation with a very high probability of correctness using Groebner revlex computation, Berlekamp-Massey algorithm and Hankel linear system solving modulo several primes in parallel. This algorithm is implemented in Giac/Xcas since version 1.7.0-13, it has (June 2021) leading performances on multiple CPU, at least for an open-source software.

翻译：这篇文章没有引入新的数学理念, 更像是2021年6月关于通过利用Groebner revlex计算、 Berlekamp- Massey 算法和Hankel 线性系统平行解决模数质, 重建一个合理且极有可能正确性的合理单词表达法, 从而有效解决多元体系的艺术水平。 这个算法在Giac/ Xcas 中实施, 自1. 7. 0- 13版以来, 它( 2021年6月 ) 已经在多个 CPU 上( 至少是在开放源软件上) 领先表现 。