Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time

Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time
复制标题

在平均多项式时间内计算 p 曲率的特征多项式

DOI:
--
复制
发表时间:
2021
期刊:
International Symposium on Symbolic and Algebraic Computation
影响因子:
--
通讯作者:
Raphaël Pagès
Raphaël Pagès
中科院分区:
--
文献类型:
--
作者:
Raphaël Pagès

文献摘要

被引文献

相似文献

我们设计了一个快速算法,对于给定的系数为918;[x]的线性微分算子,计算其p-曲率的所有特征多项式,对于所有素数p<N,在N中的渐近拟线性比特复杂度。我们将特别看到,我们的算法的良好性能很快就可见。
We design a fast algorithm that computes, for a given linear differential operator with coefficients in 918;[x], all the characteristic polynomials of its p-curvatures, for all primes p < N, in asymptoti- cally quasi-linear bit complexity in N. We discuss implementations and applications of our algorithm. We shall see in particular that the good performances of our algorithm are quickly visible.