_fmpz_poly_mullow_SS_precache, fmpz_poly_mullow_SS_precache, fmpz_poly_mul_SS_precache
Synopsis
#include <flint/fmpz_poly.h>void _fmpz_poly_mullow_SS_precache(fmpz * output, const fmpz * input1, slong len1, fmpz_poly_mul_precache_t pre, slong trunc)sourcevoid fmpz_poly_mullow_SS_precache(fmpz_poly_t res, const fmpz_poly_t poly1, fmpz_poly_mul_precache_t pre, slong n)sourcevoid fmpz_poly_mul_SS_precache(fmpz_poly_t res, const fmpz_poly_t poly1, fmpz_poly_mul_precache_t pre)sourceSet res to the product of poly1 and the polynomial stored in pre, truncated to length n (trunc) for the mullow versions. The length and bit size of poly1 must not exceed those given to fmpz_poly_mul_SS_precache_init. The non-underscore versions use classical multiplication when one of the lengths or n is at most 2. The underscore version requires trunc to be at most the length of the product and does not allow output to overlap input1.
Guides#
Cite this page
The FLINT team, “_fmpz_poly_mullow_SS_precache, fmpz_poly_mullow_SS_precache, fmpz_poly_mul_SS_precache (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/_fmpz_poly_mullow_SS_precache.html (generated 2026-10-20).
@misc{flint-doc-fmpz-poly-fmpz-poly-mullow-SS-precache,
author = {{The FLINT team}},
title = {{\_fmpz\_poly\_mullow\_SS\_precache, fmpz\_poly\_mullow\_SS\_precache, fmpz\_poly\_mul\_SS\_precache (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_mullow_SS_precache.html},
note = {Generated 2026-10-20}
}