_fq_zech_poly_mulhigh, fq_zech_poly_mulhigh
#include <flint/fq_zech_poly.h>void _fq_zech_poly_mulhigh(fq_zech_struct * res, const fq_zech_struct * poly1, slong len1, const fq_zech_struct * poly2, slong len2, slong n, fq_zech_ctx_t ctx)void fq_zech_poly_mulhigh(fq_zech_poly_t rop, const fq_zech_poly_t op1, const fq_zech_poly_t op2, slong start, const fq_zech_ctx_t ctx)Compute the coefficients of index at least n (start) of the product. fq_zech_poly_mulhigh sets rop to a polynomial of length len1 + len2 - 1 whose coefficients from start on are those of the product and whose lower coefficients are zero; it uses the classical algorithm. _fq_zech_poly_mulhigh requires len1 \ge len2 \ge 1 and space for len1 + len2 - 1 coefficients, sets the coefficients below n to zero and uses the substitution algorithm (a middle product) if _fq_zech_poly_mulmid_want_univariate selects it.
The FLINT team, “_fq_zech_poly_mulhigh, fq_zech_poly_mulhigh (fq_zech_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_zech_poly/_fq_zech_poly_mulhigh.html (generated 2026-10-20).
@misc{flint-doc-fq-zech-poly-fq-zech-poly-mulhigh,
author = {{The FLINT team}},
title = {{\_fq\_zech\_poly\_mulhigh, fq\_zech\_poly\_mulhigh (fq\_zech\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_zech_poly/_fq_zech_poly_mulhigh.html},
note = {Generated 2026-10-20}
}