_fq_nmod_poly_mulhigh, fq_nmod_poly_mulhigh
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_mulhigh(fq_nmod_struct * res, const fq_nmod_struct * poly1, slong len1, const fq_nmod_struct * poly2, slong len2, slong n, fq_nmod_ctx_t ctx)void fq_nmod_poly_mulhigh(fq_nmod_poly_t rop, const fq_nmod_poly_t op1, const fq_nmod_poly_t op2, slong start, const fq_nmod_ctx_t ctx)Compute the coefficients of index at least n (start) of the product. fq_nmod_poly_mulhigh sets rop to a polynomial of length len1 + len2 - 1 whose coefficients from start on are those of the product and whose lower coefficients are zero; it uses the classical algorithm. _fq_nmod_poly_mulhigh requires len1 \ge len2 \ge 1 and space for len1 + len2 - 1 coefficients in res; its coefficients below n are arbitrary (it computes the full product by Kronecker substitution for inputs of length at least 6).
Generated from the same template as _fq_poly_mulhigh, whose documentation has the details.
The FLINT team, “_fq_nmod_poly_mulhigh, fq_nmod_poly_mulhigh (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_mulhigh.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-mulhigh,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_mulhigh, fq\_nmod\_poly\_mulhigh (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_mulhigh.html},
note = {Generated 2026-10-20}
}