_nmod_poly_mullow_KS, nmod_poly_mullow_KS
Synopsis
#include <flint/nmod_poly.h>void _nmod_poly_mullow_KS(nn_ptr out, nn_srcptr in1, slong len1, nn_srcptr in2, slong len2, slong n, nmod_t mod)sourcevoid nmod_poly_mullow_KS(nmod_poly_t res, const nmod_poly_t poly1, const nmod_poly_t poly2, slong n)sourceSet res to the product modulo x^n by Kronecker substitution. The underscore version requires \mathit{len1}, \mathit{len2} \ge 1 and 1 \le n \le \mathit{len1} + \mathit{len2} - 1. It multiplies the operands truncated to length n in full and unpacks the low n coefficients.
Cite this page
The FLINT team, “_nmod_poly_mullow_KS, nmod_poly_mullow_KS (nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_poly/_nmod_poly_mullow_KS.html (generated 2026-10-20).
@misc{flint-doc-nmod-poly-nmod-poly-mullow-KS,
author = {{The FLINT team}},
title = {{\_nmod\_poly\_mullow\_KS, nmod\_poly\_mullow\_KS (nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_poly/_nmod_poly_mullow_KS.html},
note = {Generated 2026-10-20}
}