_fq_nmod_poly_powmod_fmpz_sliding_preinv, fq_nmod_poly_powmod_fmpz_sliding_preinv
Synopsis
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_powmod_fmpz_sliding_preinv(fq_nmod_struct * res, const fq_nmod_struct * poly, const fmpz_t e, ulong k, const fq_nmod_struct * f, slong lenf, const fq_nmod_struct * finv, slong lenfinv, const fq_nmod_ctx_t ctx)void fq_nmod_poly_powmod_fmpz_sliding_preinv(fq_nmod_poly_t res, const fq_nmod_poly_t poly, const fmpz_t e, ulong k, const fq_nmod_poly_t f, const fq_nmod_poly_t finv, const fq_nmod_ctx_t ctx)As fq_nmod_poly_powmod_fmpz_binexp_preinv, using sliding window exponentiation with windows of k bits; k = 0 chooses k from the size of e.
Generated from the same template as _fq_poly_powmod_fmpz_sliding_preinv, whose documentation has the details.
Cite this page
The FLINT team, “_fq_nmod_poly_powmod_fmpz_sliding_preinv, fq_nmod_poly_powmod_fmpz_sliding_preinv (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_powmod_fmpz_sliding_preinv.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-powmod-fmpz-sliding-preinv,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_powmod\_fmpz\_sliding\_preinv, fq\_nmod\_poly\_powmod\_fmpz\_sliding\_preinv (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_powmod_fmpz_sliding_preinv.html},
note = {Generated 2026-10-20}
}