_nmod_poly_exp_series, nmod_poly_exp_series
Synopsis
#include <flint/nmod_poly.h>void nmod_poly_exp_series(nmod_poly_t f, const nmod_poly_t h, slong n)sourceSet f = \exp(h) \bmod x^n.
The algorithm depends on the length of h (not on n). If h has fewer than about 230 to 490 coefficients (with fft_small, depending on the bit size of p), the recurrence k f_k = \sum_{j = 1}^{k} j h_j f_{k - j} from f' = h' f is used, which costs O(n \cdot \mathit{hlen}); up to about 470 to 1490 coefficients the same recurrence with the sums computed by blocks of multiplications; beyond that Newton iteration.
Guides#
Cite this page
The FLINT team, “_nmod_poly_exp_series, nmod_poly_exp_series (nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_poly/_nmod_poly_exp_series.html (generated 2026-10-20).
@misc{flint-doc-nmod-poly-nmod-poly-exp-series,
author = {{The FLINT team}},
title = {{\_nmod\_poly\_exp\_series, nmod\_poly\_exp\_series (nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_poly/_nmod_poly_exp_series.html},
note = {Generated 2026-10-20}
}