FQ_NMOD_POLY_ITERATED_FROBENIUS_CUTOFF
Synopsis
#include <flint/fq_nmod_poly_factor.h>int FQ_NMOD_POLY_ITERATED_FROBENIUS_CUTOFF(const fq_nmod_ctx_t ctx, slong length)sourceReturns 1 if fq_nmod_poly_iterated_frobenius_preinv should use modular composition for a modulus of length length, which is the case if 2 \log_2 q < 3(\lfloor \sqrt{\mathit{length}} \rfloor + 1).
Cite this page
The FLINT team, “FQ_NMOD_POLY_ITERATED_FROBENIUS_CUTOFF (fq_nmod_poly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_poly_factor/FQ_NMOD_POLY_ITERATED_FROBENIUS_CUTOFF.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-factor-FQ-NMOD-POLY-ITERATED-FROBENIUS-CUTOFF,
author = {{The FLINT team}},
title = {{FQ\_NMOD\_POLY\_ITERATED\_FROBENIUS\_CUTOFF (fq\_nmod\_poly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_poly_factor/FQ_NMOD_POLY_ITERATED_FROBENIUS_CUTOFF.html},
note = {Generated 2026-10-20}
}