fmpz_poly_mul_SS_precache_init
Synopsis
#include <flint/fmpz_poly.h>void fmpz_poly_mul_SS_precache_init(fmpz_poly_mul_precache_t pre, slong len1, slong bits1, const fmpz_poly_t poly2)sourcePrecomputes the transform of poly2 for multiplications by polynomials of length at most len1 whose coefficients have at most bits1 bits. The transform length is the power of two 2^k \ge \mathit{len1} + \mathit{len2} - 1; products whose length is at most 2^{k-1} are computed with the same, too long, transform. bits1 may be negative, as returned by fmpz_poly_max_bits for polynomials with negative coefficients; only its absolute value is used.
Guides#
Cite this page
The FLINT team, “fmpz_poly_mul_SS_precache_init (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/fmpz_poly_mul_SS_precache_init.html (generated 2026-10-20).
@misc{flint-doc-fmpz-poly-fmpz-poly-mul-SS-precache-init,
author = {{The FLINT team}},
title = {{fmpz\_poly\_mul\_SS\_precache\_init (fmpz\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_poly/fmpz_poly_mul_SS_precache_init.html},
note = {Generated 2026-10-20}
}