_fmpz_mod_poly_mul, fmpz_mod_poly_mul
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_mul(fmpz * res, const fmpz * poly1, slong len1, const fmpz * poly2, slong len2, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_mul(fmpz_mod_poly_t res, const fmpz_mod_poly_t poly1, const fmpz_mod_poly_t poly2, const fmpz_mod_ctx_t ctx)sourceSet res to the product of poly1 and poly2. The underscore version writes \mathit{len1} + \mathit{len2} - 1 coefficients, requires positive lengths (in either order) and allows zero-padded inputs.
The product is computed over \mathbb{Z} with _fmpz_poly_mul and then reduced; for large inputs this uses Kronecker substitution or FFT multiplication of integer polynomials, so its cost is roughly that of one integer product of about (\mathit{len1} + \mathit{len2})(2 \log_2 n + \log_2 \mathit{len}) bits.
Guides#
Cite this page
The FLINT team, “_fmpz_mod_poly_mul, fmpz_mod_poly_mul (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_mul.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-mul,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_mul, fmpz\_mod\_poly\_mul (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_mul.html},
note = {Generated 2026-10-20}
}