_fq_zech_poly_mulmid_want_univariate, _fq_zech_poly_sqr_want_univariate
#include <flint/fq_zech_poly.h>int _fq_zech_poly_mulmid_want_univariate(slong len1, slong len2, slong nlo, slong nhi, const fq_zech_ctx_t ctx)sourceint _fq_zech_poly_sqr_want_univariate(slong len, const fq_zech_ctx_t ctx)sourceReturn whether the substitution algorithm should be used for the middle product of lengths len1 and len2 with output range [\mathit{nlo}, \mathit{nhi}), respectively for squaring a polynomial of length len. The decision compares an estimate of the work of the classical algorithm (the number of term products in the output range) with the length of the substituted product, scaled by _fq_zech_poly_mul_univariate_threshold; it is never taken if the shorter input has fewer terms than the threshold.
The FLINT team, “_fq_zech_poly_mulmid_want_univariate, _fq_zech_poly_sqr_want_univariate (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_mulmid_want_univariate.html (generated 2026-10-20).
@misc{flint-doc-fq-zech-poly-fq-zech-poly-mulmid-want-univariate,
author = {{The FLINT team}},
title = {{\_fq\_zech\_poly\_mulmid\_want\_univariate, \_fq\_zech\_poly\_sqr\_want\_univariate (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_mulmid_want_univariate.html},
note = {Generated 2026-10-20}
}