_fq_nmod_poly_mullow, fq_nmod_poly_mullow
Synopsis
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_mullow(fq_nmod_struct * rop, const fq_nmod_struct * op1, slong len1, const fq_nmod_struct * op2, slong len2, slong n, const fq_nmod_ctx_t ctx)void fq_nmod_poly_mullow(fq_nmod_poly_t rop, const fq_nmod_poly_t op1, const fq_nmod_poly_t op2, slong n, const fq_nmod_ctx_t ctx)Set rop to the product truncated to length n, that is, the low n coefficients of \mathit{op1} \cdot \mathit{op2}. The underscore version requires 0 < n \le \mathit{len1} + \mathit{len2} - 1 and len1, len2 \ge 1, writes n coefficients and does not allow aliasing. The classical algorithm is used for n below FQ_NMOD_MULLOW_CLASSICAL_CUTOFF (6) or short inputs, and Kronecker substitution otherwise.
Generated from the same template as _fq_poly_mullow, whose documentation has the details.
Cite this page
The FLINT team, “_fq_nmod_poly_mullow, fq_nmod_poly_mullow (fq_nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_mullow.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-mullow,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_mullow, fq\_nmod\_poly\_mullow (fq\_nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_mullow.html},
note = {Generated 2026-10-20}
}