_fq_nmod_poly_mul, fq_nmod_poly_mul
Synopsis
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_mul(fq_nmod_struct * rop, const fq_nmod_struct * op1, slong len1, const fq_nmod_struct * op2, slong len2, const fq_nmod_ctx_t ctx)sourcevoid fq_nmod_poly_mul(fq_nmod_poly_t rop, const fq_nmod_poly_t op1, const fq_nmod_poly_t op2, const fq_nmod_ctx_t ctx)sourceSet rop to \mathit{op1} \cdot \mathit{op2}, choosing the algorithm. The underscore version writes len1 + len2 - 1 coefficients, requires len1, len2 \ge 1 and does not allow aliasing.
Generated from the same template as _fq_poly_mul, whose documentation has the details. The algorithm selection of each representation is described in Multiplying polynomials over finite fields.
Cite this page
The FLINT team, “_fq_nmod_poly_mul, fq_nmod_poly_mul (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_mul.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-mul,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_mul, fq\_nmod\_poly\_mul (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_mul.html},
note = {Generated 2026-10-20}
}