TY - GEN
T1 - Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time
AU - Pagès, Raphaël
PY - 2021/7/18
Y1 - 2021/7/18
N2 - We design a fast algorithm that computes, for a given linear differential operator with coefficients in $Z[x ]$, all the characteristic polynomials of its p-curvatures, for all primes $p < N$ , in asymptotically 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.
AB - We design a fast algorithm that computes, for a given linear differential operator with coefficients in $Z[x ]$, all the characteristic polynomials of its p-curvatures, for all primes $p < N$ , in asymptotically 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.
UR - https://www.scopus.com/pages/publications/85111087640
U2 - 10.1145/3452143.3465524
DO - 10.1145/3452143.3465524
M3 - Conference proceedings
T3 - Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC
SP - 329
EP - 336
BT - ISSAC 2021 - Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation
ER -