_fq_poly_powmod_ui_binexp_preinv, fq_poly_powmod_ui_binexp_preinv, _fq_poly_powmod_fmpz_binexp_preinv, fq_poly_powmod_fmpz_binexp_preinv
Synopsis
#include <flint/fq_poly.h>void _fq_poly_powmod_ui_binexp_preinv(fq_struct * res, const fq_struct * poly, ulong e, const fq_struct * f, slong lenf, const fq_struct * finv, slong lenfinv, const fq_ctx_t ctx)void fq_poly_powmod_ui_binexp_preinv(fq_poly_t res, const fq_poly_t poly, ulong e, const fq_poly_t f, const fq_poly_t finv, const fq_ctx_t ctx)void _fq_poly_powmod_fmpz_binexp_preinv(fq_struct * res, const fq_struct * poly, const fmpz_t e, const fq_struct * f, slong lenf, const fq_struct * finv, slong lenfinv, const fq_ctx_t ctx)void fq_poly_powmod_fmpz_binexp_preinv(fq_poly_t res, const fq_poly_t poly, const fmpz_t e, const fq_poly_t f, const fq_poly_t finv, const fq_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.
Cite this page
The FLINT team, “_fq_poly_powmod_ui_binexp_preinv, fq_poly_powmod_ui_binexp_preinv, _fq_poly_powmod_fmpz_binexp_preinv, fq_poly_powmod_fmpz_binexp_preinv (fq_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_poly/_fq_poly_powmod_ui_binexp_preinv.html (generated 2026-10-20).
@misc{flint-doc-fq-poly-fq-poly-powmod-ui-binexp-preinv,
author = {{The FLINT team}},
title = {{\_fq\_poly\_powmod\_ui\_binexp\_preinv, fq\_poly\_powmod\_ui\_binexp\_preinv, \_fq\_poly\_powmod\_fmpz\_binexp\_preinv, fq\_poly\_powmod\_fmpz\_binexp\_preinv (fq\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_poly/_fq_poly_powmod_ui_binexp_preinv.html},
note = {Generated 2026-10-20}
}