_fq_poly_mul_univariate, fq_poly_mul_univariate
Synopsis
#include <flint/fq_poly.h>void _fq_poly_mul_univariate(fq_struct * rop, const fq_struct * op1, slong len1, const fq_struct * op2, slong len2, const fq_ctx_t ctx)sourcevoid fq_poly_mul_univariate(fq_poly_t rop, const fq_poly_t op1, const fq_poly_t op2, const fq_ctx_t ctx)sourceSet rop to the product, computed by viewing the polynomials as bivariate polynomials in x and the generator y of \mathbb{F}_q and substituting y = x^{2d-1}, which gives one product of integer polynomials of length about (2d - 1)\,\mathit{len}. The underscore version requires len1, len2 \ge 1, a nonzero leading coefficient of both inputs and writes len1 + len2 - 1 coefficients.
Cite this page
The FLINT team, “_fq_poly_mul_univariate, fq_poly_mul_univariate (fq_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_poly/_fq_poly_mul_univariate.html (generated 2026-10-20).
@misc{flint-doc-fq-poly-fq-poly-mul-univariate,
author = {{The FLINT team}},
title = {{\_fq\_poly\_mul\_univariate, fq\_poly\_mul\_univariate (fq\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_poly/_fq_poly_mul_univariate.html},
note = {Generated 2026-10-20}
}