FLINT3.7.0-dev

_fq_nmod_poly_compose_mod_horner, fq_nmod_poly_compose_mod_horner, _fq_nmod_poly_compose_mod_horner_preinv, fq_nmod_poly_compose_mod_horner_preinv

Synopsis#include <flint/fq_nmod_poly.h>
void _fq_nmod_poly_compose_mod_horner(fq_nmod_struct * res, const fq_nmod_struct * f, slong lenf, const fq_nmod_struct * g, const fq_nmod_struct * h, slong lenh, const fq_nmod_ctx_t ctx)
void fq_nmod_poly_compose_mod_horner(fq_nmod_poly_t res, const fq_nmod_poly_t poly1, const fq_nmod_poly_t poly2, const fq_nmod_poly_t poly3, const fq_nmod_ctx_t ctx)
void _fq_nmod_poly_compose_mod_horner_preinv(fq_nmod_struct * res, const fq_nmod_struct * f, slong lenf, const fq_nmod_struct * g, const fq_nmod_struct * h, slong lenh, const fq_nmod_struct * hinv, slong lenhinv, const fq_nmod_ctx_t ctx)
void fq_nmod_poly_compose_mod_horner_preinv(fq_nmod_poly_t res, const fq_nmod_poly_t poly1, const fq_nmod_poly_t poly2, const fq_nmod_poly_t poly3, const fq_nmod_poly_t poly3inv, const fq_nmod_ctx_t ctx)

Modular composition by Horner's rule, with \deg f multiplications modulo h. Requirements as for fq_nmod_poly_compose_mod; the _preinv versions also require \mathit{lenf} < \mathit{lenh} and the inverse of the reversal of h.

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

Cite this page

The FLINT team, “_fq_nmod_poly_compose_mod_horner, fq_nmod_poly_compose_mod_horner, _fq_nmod_poly_compose_mod_horner_preinv, fq_nmod_poly_compose_mod_horner_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_compose_mod_horner.html (generated 2026-10-20).