_fq_nmod_poly_mul_KS, fq_nmod_poly_mul_KS
Synopsis
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_mul_KS(fq_nmod_struct * rop, const fq_nmod_struct * op1, slong len1, const fq_nmod_struct * op2, slong len2, const fq_nmod_ctx_t ctx)void fq_nmod_poly_mul_KS(fq_nmod_poly_t rop, const fq_nmod_poly_t op1, const fq_nmod_poly_t op2, const fq_nmod_ctx_t ctx)Set rop to the product, computed by Kronecker substitution: every coefficient is packed into one integer, the integer polynomials are multiplied with _fmpz_poly_mul, and the coefficients are unpacked and reduced. The underscore version allows zero padding of the inputs (it writes len1 + len2 - 1 coefficients) and aliasing.
Generated from the same template as _fq_poly_mul_KS, whose documentation has the details.
Cite this page
The FLINT team, “_fq_nmod_poly_mul_KS, fq_nmod_poly_mul_KS (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_KS.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-mul-KS,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_mul\_KS, fq\_nmod\_poly\_mul\_KS (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_KS.html},
note = {Generated 2026-10-20}
}