Composing power series over a finite ring in essentially linear time

DOI10.1006/jsco.1998.0216zbMath0934.68129OpenAlexW2052024558MaRDI QIDQ1267071

Daniel J. Bernstein

Publication date: 12 October 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1998.0216

zbMATH Keywords

fast algorithmspower seriesmodular compositioniteration of power seriesorder-\(n\) power series compositionreversion of power series

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Formal power series rings (13F25)

Related Items (6)

Fast algorithms for computing isogenies between elliptic curves ⋮ Modular composition via factorization ⋮ Fast multivariate multi-point evaluation revisited ⋮ A fast algorithm for reversion of power series ⋮ Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey ⋮ Relax, but don't be too lazy

This page was built for publication: Composing power series over a finite ring in essentially linear time