_fmpq_poly_compose_series_brent_kung, fmpq_poly_compose_series_brent_kung
Synopsis
#include <flint/fmpq_poly.h>void _fmpq_poly_compose_series_brent_kung(fmpz * res, fmpz_t den, const fmpz * poly1, const fmpz_t den1, slong len1, const fmpz * poly2, const fmpz_t den2, slong len2, slong n)sourcevoid fmpq_poly_compose_series_brent_kung(fmpq_poly_t res, const fmpq_poly_t poly1, const fmpq_poly_t poly2, slong n)sourceCompose by the baby-step giant-step algorithm 2.1 of Brent and Kung [BrentKung1978], with about 2\sqrt{n} truncated multiplications and a matrix product over \mathbb{Z}.
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, “_fmpq_poly_compose_series_brent_kung, fmpq_poly_compose_series_brent_kung (fmpq_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpq_poly/_fmpq_poly_compose_series_brent_kung.html (generated 2026-10-20).
@misc{flint-doc-fmpq-poly-fmpq-poly-compose-series-brent-kung,
author = {{The FLINT team}},
title = {{\_fmpq\_poly\_compose\_series\_brent\_kung, fmpq\_poly\_compose\_series\_brent\_kung (fmpq\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpq_poly/_fmpq_poly_compose_series_brent_kung.html},
note = {Generated 2026-10-20}
}