n_poly_mod_eval_step2
Synopsis
#include <flint/n_poly.h>One step of the evaluation of a sparse polynomial at consecutive powers of a point: with c_i = Acur[i] and Ainc holding the pairs (a_i, m_i), returns \sum_i c_i a_i and replaces each c_i by c_i m_i. Ainc must have twice the length of Acur.
Cite this page
The FLINT team, “n_poly_mod_eval_step2 (n_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/n_poly/n_poly_mod_eval_step2.html (generated 2026-10-20).
@misc{flint-doc-n-poly-n-poly-mod-eval-step2,
author = {{The FLINT team}},
title = {{n\_poly\_mod\_eval\_step2 (n\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/n_poly/n_poly_mod_eval_step2.html},
note = {Generated 2026-10-20}
}