_fq_zech_poly_mulhigh_classical, fq_zech_poly_mulhigh_classical
Synopsis
#include <flint/fq_zech_poly.h>void _fq_zech_poly_mulhigh_classical(fq_zech_struct * rop, const fq_zech_struct * op1, slong len1, const fq_zech_struct * op2, slong len2, slong start, const fq_zech_ctx_t ctx)void fq_zech_poly_mulhigh_classical(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)As the previous functions, with the classical algorithm, which computes only the coefficients from start on and sets the lower ones to zero. The underscore version requires len1 len2 and does not allow aliasing.
Generated from the same template as _fq_poly_mulhigh_classical, whose documentation has the details.
Cite this page
The FLINT team, “_fq_zech_poly_mulhigh_classical, fq_zech_poly_mulhigh_classical (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_classical.html (generated 2026-11-02).
@misc{flint-doc-fq-zech-poly-fq-zech-poly-mulhigh-classical,
author = {{The FLINT team}},
title = {{\_fq\_zech\_poly\_mulhigh\_classical, fq\_zech\_poly\_mulhigh\_classical (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_classical.html},
note = {Generated 2026-11-02}
}