FLINT3.7.0-dev

_fq_nmod_poly_mullow_classical, fq_nmod_poly_mullow_classical, _fq_nmod_poly_mullow_KS, fq_nmod_poly_mullow_KS, _fq_nmod_poly_mullow_univariate, fq_nmod_poly_mullow_univariate

Synopsis#include <flint/fq_nmod_poly.h>
void _fq_nmod_poly_mullow_classical(fq_nmod_struct * rop, const fq_nmod_struct * op1, slong len1, const fq_nmod_struct * op2, slong len2, slong n, const fq_nmod_ctx_t ctx)
void fq_nmod_poly_mullow_classical(fq_nmod_poly_t rop, const fq_nmod_poly_t op1, const fq_nmod_poly_t op2, slong n, const fq_nmod_ctx_t ctx)
void _fq_nmod_poly_mullow_KS(fq_nmod_struct * rop, const fq_nmod_struct * op1, slong len1, const fq_nmod_struct * op2, slong len2, slong n, const fq_nmod_ctx_t ctx)
void fq_nmod_poly_mullow_KS(fq_nmod_poly_t rop, const fq_nmod_poly_t op1, const fq_nmod_poly_t op2, slong n, const fq_nmod_ctx_t ctx)
void _fq_nmod_poly_mullow_univariate(fq_nmod_struct * rop, const fq_nmod_struct * op1, slong len1, const fq_nmod_struct * op2, slong len2, slong n, const fq_nmod_ctx_t ctx)source
void fq_nmod_poly_mullow_univariate(fq_nmod_poly_t rop, const fq_nmod_poly_t op1, const fq_nmod_poly_t op2, slong n, const fq_nmod_ctx_t ctx)source

Truncated products with a fixed algorithm: classical, Kronecker substitution, or the substitution y = x^{2d-1}. The underscore versions require 0 < n \le \mathit{len1} + \mathit{len2} - 1 and write n coefficients; _fq_nmod_poly_mullow_KS allows zero padding and zero inputs.

Generated from the same template as _fq_poly_mullow_classical, whose documentation has the details.

Cite this page

The FLINT team, “_fq_nmod_poly_mullow_classical, fq_nmod_poly_mullow_classical, _fq_nmod_poly_mullow_KS, fq_nmod_poly_mullow_KS, _fq_nmod_poly_mullow_univariate, fq_nmod_poly_mullow_univariate (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_mullow_classical.html (generated 2026-10-20).