nmod_poly_hgcd_iter_recursive_cutoff, nmod_poly_hgcd_outer_cutoff, nmod_poly_gcd_hgcd_cutoff, nmod_poly_xgcd_hgcd_cutoff
Synopsis
#include <flint/nmod_poly.h>Return the tuned cutoffs for the bit size of the modulus: the length below which the half-GCD recursion uses Euclidean steps (60 to 244), the length below which the outer loop of the half-GCD GCD switches to the Euclidean algorithm (310 to 1585), and the length of B from which _nmod_poly_gcd (470 to 2199) and _nmod_poly_xgcd (72 to 388) use the half-GCD algorithm.
Cite this page
The FLINT team, “nmod_poly_hgcd_iter_recursive_cutoff, nmod_poly_hgcd_outer_cutoff, nmod_poly_gcd_hgcd_cutoff, nmod_poly_xgcd_hgcd_cutoff (nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_poly/nmod_poly_hgcd_iter_recursive_cutoff.html (generated 2026-10-20).
@misc{flint-doc-nmod-poly-nmod-poly-hgcd-iter-recursive-cutoff,
author = {{The FLINT team}},
title = {{nmod\_poly\_hgcd\_iter\_recursive\_cutoff, nmod\_poly\_hgcd\_outer\_cutoff, nmod\_poly\_gcd\_hgcd\_cutoff, nmod\_poly\_xgcd\_hgcd\_cutoff (nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_poly/nmod_poly_hgcd_iter_recursive_cutoff.html},
note = {Generated 2026-10-20}
}