_n_fq_poly_mul_, n_fq_poly_mul_, n_fq_poly_mul, n_fq_poly_mullow
#include <flint/n_poly.h>void _n_fq_poly_mul_(ulong * A, const ulong * B, slong Blen, const ulong * C, slong Clen, const fq_nmod_ctx_t ctx, n_poly_stack_t St)sourcevoid n_fq_poly_mul_(n_poly_t A, const n_poly_t B, const n_poly_t C, const fq_nmod_ctx_t ctx, n_poly_stack_t St)sourcevoid n_fq_poly_mul(n_poly_t A, const n_poly_t B, const n_poly_t C, const fq_nmod_ctx_t ctx)sourcevoid n_fq_poly_mullow(n_poly_t A, const n_poly_t B, const n_poly_t C, slong order, const fq_nmod_ctx_t ctx)sourceMultiplication (truncated to length order for n_fq_poly_mullow). If one factor has fewer than 4 terms the product is computed classically with delayed reduction; otherwise by Kronecker substitution: each coefficient is placed in a slot of 2d - 1 words, the packed polynomials are multiplied with _nmod_poly_mul, and the slots are reduced modulo the defining polynomial. The trailing-underscore versions take a stack of temporaries; _n_fq_poly_mul_ works on arrays of Blen and Clen coefficients and writes \mathit{Blen} + \mathit{Clen} - 1.
The FLINT team, “_n_fq_poly_mul_, n_fq_poly_mul_, n_fq_poly_mul, n_fq_poly_mullow (n_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/n_poly/_n_fq_poly_mul_.html (generated 2026-10-20).
@misc{flint-doc-n-poly-n-fq-poly-mul,
author = {{The FLINT team}},
title = {{\_n\_fq\_poly\_mul\_, n\_fq\_poly\_mul\_, n\_fq\_poly\_mul, n\_fq\_poly\_mullow (n\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/n_poly/_n_fq_poly_mul_.html},
note = {Generated 2026-10-20}
}