Composition Modulo Powers of Polynomials

DOI10.1145/3087604.3087634zbMath1457.68331OpenAlexW2738987789MaRDI QIDQ5119973

Grégoire Lecerf, Joris van der Hoeven

Publication date: 9 September 2020

Published in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3087604.3087634

zbMATH Keywords

complexityalgorithmmodular compositionseries composition

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)

Related Items (6)

On the complexity exponent of polynomial system solving ⋮ Computing Riemann-Roch spaces via Puiseux expansions ⋮ Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology ⋮ Directed evaluation ⋮ Modular composition via factorization ⋮ Fast multivariate multi-point evaluation revisited

This page was built for publication: Composition Modulo Powers of Polynomials