_fq_poly_mulmod_preinv, fq_poly_mulmod_preinv
Synopsis
#include <flint/fq_poly.h>void _fq_poly_mulmod_preinv(fq_struct * res, const fq_struct * poly1, slong len1, const fq_struct * poly2, slong len2, const fq_struct * f, slong lenf, const fq_struct * finv, slong lenfinv, const fq_ctx_t ctx)void fq_poly_mulmod_preinv(fq_poly_t res, const fq_poly_t poly1, const fq_poly_t poly2, const fq_poly_t f, const fq_poly_t finv, const fq_ctx_t ctx)As fq_poly_mulmod, with the precomputed inverse finv of the reversal of f modulo x^{\deg f + 1} (fq_poly_reverse followed by fq_poly_inv_series). The product must satisfy \mathit{len1} + \mathit{len2} - 1 \le 2\,\mathit{lenf} - 2; the inputs need not be reduced. The underscore version does not allow aliasing.
Cite this page
The FLINT team, “_fq_poly_mulmod_preinv, fq_poly_mulmod_preinv (fq_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_poly/_fq_poly_mulmod_preinv.html (generated 2026-10-20).
@misc{flint-doc-fq-poly-fq-poly-mulmod-preinv,
author = {{The FLINT team}},
title = {{\_fq\_poly\_mulmod\_preinv, fq\_poly\_mulmod\_preinv (fq\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_poly/_fq_poly_mulmod_preinv.html},
note = {Generated 2026-10-20}
}