_fq_nmod_poly_mul_univariate, fq_nmod_poly_mul_univariate
Synopsis
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_mul_univariate(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_univariate(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 the product, computed by substituting y = x^{2d-1} for the generator of \mathbb{F}_q, which gives one product in (\mathbb{Z}/p\mathbb{Z})[x] of length about (2d - 1)\,\mathit{len} computed with _nmod_poly_mul, and reducing each block of 2d - 1 coefficients modulo the defining polynomial. The underscore version requires len1, len2 \ge 1 and writes len1 + len2 - 1 coefficients.
Cite this page
The FLINT team, “_fq_nmod_poly_mul_univariate, fq_nmod_poly_mul_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_mul_univariate.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-mul-univariate,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_mul\_univariate, fq\_nmod\_poly\_mul\_univariate (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_univariate.html},
note = {Generated 2026-10-20}
}