_fmpz_mod_poly_compose_mod, fmpz_mod_poly_compose_mod
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_compose_mod(fmpz * res, const fmpz * f, slong lenf, const fmpz * g, const fmpz * h, slong lenh, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_compose_mod(fmpz_mod_poly_t res, const fmpz_mod_poly_t poly1, const fmpz_mod_poly_t poly2, const fmpz_mod_poly_t poly3, const fmpz_mod_ctx_t ctx)sourceSet res to f(g) \bmod h (in the non-underscore version f, g, h are poly1, poly2, poly3), choosing between Horner's rule and the Brent–Kung algorithm according to the lengths.
Cite this page
The FLINT team, “_fmpz_mod_poly_compose_mod, fmpz_mod_poly_compose_mod (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_compose_mod.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-compose-mod,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_compose\_mod, fmpz\_mod\_poly\_compose\_mod (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_compose_mod.html},
note = {Generated 2026-10-20}
}