_fq_nmod_poly_pow_trunc, fq_nmod_poly_pow_trunc, _fq_nmod_poly_pow_trunc_binexp, fq_nmod_poly_pow_trunc_binexp
Synopsis
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_pow_trunc(fq_nmod_struct * res, const fq_nmod_struct * poly, ulong e, slong trunc, const fq_nmod_ctx_t ctx)void fq_nmod_poly_pow_trunc(fq_nmod_poly_t res, const fq_nmod_poly_t poly, ulong e, slong trunc, const fq_nmod_ctx_t ctx)void _fq_nmod_poly_pow_trunc_binexp(fq_nmod_struct * res, const fq_nmod_struct * poly, ulong e, slong trunc, const fq_nmod_ctx_t ctx)void fq_nmod_poly_pow_trunc_binexp(fq_nmod_poly_t res, const fq_nmod_poly_t poly, ulong e, slong trunc, const fq_nmod_ctx_t ctx)Set res to \mathit{poly}^e \bmod x^{\mathit{trunc}}, by binary exponentiation with truncated multiplications. The underscore versions require the input to be zero-padded to length trunc, trunc > 0, e > 1 and space for trunc coefficients, and do not allow aliasing.
Generated from the same template as _fq_poly_pow_trunc, whose documentation has the details.
Cite this page
The FLINT team, “_fq_nmod_poly_pow_trunc, fq_nmod_poly_pow_trunc, _fq_nmod_poly_pow_trunc_binexp, fq_nmod_poly_pow_trunc_binexp (fq_nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_pow_trunc.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-pow-trunc,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_pow\_trunc, fq\_nmod\_poly\_pow\_trunc, \_fq\_nmod\_poly\_pow\_trunc\_binexp, fq\_nmod\_poly\_pow\_trunc\_binexp (fq\_nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_pow_trunc.html},
note = {Generated 2026-10-20}
}