_fq_poly_compose_mod_horner, fq_poly_compose_mod_horner, _fq_poly_compose_mod_horner_preinv, fq_poly_compose_mod_horner_preinv
Synopsis
#include <flint/fq_poly.h>void _fq_poly_compose_mod_horner(fq_struct * res, const fq_struct * f, slong lenf, const fq_struct * g, const fq_struct * h, slong lenh, const fq_ctx_t ctx)void fq_poly_compose_mod_horner(fq_poly_t res, const fq_poly_t poly1, const fq_poly_t poly2, const fq_poly_t poly3, const fq_ctx_t ctx)void _fq_poly_compose_mod_horner_preinv(fq_struct * res, const fq_struct * f, slong lenf, const fq_struct * g, const fq_struct * h, slong lenh, const fq_struct * hinv, slong lenhinv, const fq_ctx_t ctx)void fq_poly_compose_mod_horner_preinv(fq_poly_t res, const fq_poly_t poly1, const fq_poly_t poly2, const fq_poly_t poly3, const fq_poly_t poly3inv, const fq_ctx_t ctx)Modular composition by Horner's rule, with \deg f multiplications modulo h. Requirements as for fq_poly_compose_mod; the _preinv versions also require \mathit{lenf} < \mathit{lenh} and the inverse of the reversal of h.
Cite this page
The FLINT team, “_fq_poly_compose_mod_horner, fq_poly_compose_mod_horner, _fq_poly_compose_mod_horner_preinv, fq_poly_compose_mod_horner_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_compose_mod_horner.html (generated 2026-10-20).
@misc{flint-doc-fq-poly-fq-poly-compose-mod-horner,
author = {{The FLINT team}},
title = {{\_fq\_poly\_compose\_mod\_horner, fq\_poly\_compose\_mod\_horner, \_fq\_poly\_compose\_mod\_horner\_preinv, fq\_poly\_compose\_mod\_horner\_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_compose_mod_horner.html},
note = {Generated 2026-10-20}
}