_fmpz_mod_poly_compose_mod_brent_kung, fmpz_mod_poly_compose_mod_brent_kung
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_compose_mod_brent_kung(fmpz * res, const fmpz * poly1, slong len1, const fmpz * poly2, const fmpz * poly3, slong len3, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_compose_mod_brent_kung(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 by the Brent–Kung baby-step giant-step algorithm [BrentKung1978], with about 2\sqrt{n} multiplications modulo h and one product of a \sqrt{n} \times \sqrt{n} by a \sqrt{n} \times n matrix, n = \deg h. Requires \deg f < \deg h.
References#
- [BrentKung1978] Brent, R. P. and Kung, H. T. : Fast Algorithms for Manipulating Formal Power Series, J. ACM 25:4 (1978) 581–595
Cite this page
The FLINT team, “_fmpz_mod_poly_compose_mod_brent_kung, fmpz_mod_poly_compose_mod_brent_kung (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_brent_kung.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-compose-mod-brent-kung,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_compose\_mod\_brent\_kung, fmpz\_mod\_poly\_compose\_mod\_brent\_kung (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_brent_kung.html},
note = {Generated 2026-10-20}
}