FLINT3.7.0-dev

_fq_nmod_poly_powmod_ui_binexp_preinv, fq_nmod_poly_powmod_ui_binexp_preinv, _fq_nmod_poly_powmod_fmpz_binexp_preinv, fq_nmod_poly_powmod_fmpz_binexp_preinv

Synopsis#include <flint/fq_nmod_poly.h>
void _fq_nmod_poly_powmod_ui_binexp_preinv(fq_nmod_struct * res, const fq_nmod_struct * poly, ulong e, 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_ui_binexp_preinv(fq_nmod_poly_t res, const fq_nmod_poly_t poly, ulong e, const fq_nmod_poly_t f, const fq_nmod_poly_t finv, const fq_nmod_ctx_t ctx)
void _fq_nmod_poly_powmod_fmpz_binexp_preinv(fq_nmod_struct * res, const fq_nmod_struct * poly, const fmpz_t e, 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_binexp_preinv(fq_nmod_poly_t res, const fq_nmod_poly_t poly, const fmpz_t e, const fq_nmod_poly_t f, const fq_nmod_poly_t finv, const fq_nmod_ctx_t ctx)

As the previous functions, with the precomputed inverse finv of the reversal of f, so that every reduction is a Newton division with two multiplications.

Generated from the same template as _fq_poly_powmod_ui_binexp_preinv, whose documentation has the details.

Cite this page

The FLINT team, “_fq_nmod_poly_powmod_ui_binexp_preinv, fq_nmod_poly_powmod_ui_binexp_preinv, _fq_nmod_poly_powmod_fmpz_binexp_preinv, fq_nmod_poly_powmod_fmpz_binexp_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_ui_binexp_preinv.html (generated 2026-10-20).