FLINT3.7.0-dev
/

mpoly_gcd_info_measure_hensel, mpoly_gcd_info_measure_brown, mpoly_gcd_info_measure_bma, mpoly_gcd_info_measure_zippel, mpoly_gcd_info_measure_zippel2

Synopsis#include <flint/mpoly.h>
void mpoly_gcd_info_measure_hensel(mpoly_gcd_info_t Iv, slong Alength, slong Blength, const mpoly_ctx_t mctx)source
void mpoly_gcd_info_measure_brown(mpoly_gcd_info_t Iv, slong Alength, slong Blength, const mpoly_ctx_t mctx)source
void mpoly_gcd_info_measure_bma(mpoly_gcd_info_t Iv, slong Alength, slong Blength, const mpoly_ctx_t mctx)source
void mpoly_gcd_info_measure_zippel(mpoly_gcd_info_t Iv, slong Alength, slong Blength, const mpoly_ctx_t mctx)source
void mpoly_gcd_info_measure_zippel2(mpoly_gcd_info_t Iv, slong Alength, slong Blength, const mpoly_ctx_t mctx)source

Decide whether an algorithm is applicable and, if so, set its bit in Iv->can_use, choose its variable order and estimate its cost. Brown and Hensel need at least two variables whose dense representations fit, and their cost is modelled from the products of the degrees of G, A/G and B/G; Zippel chooses as main variable one with few leading and trailing terms; the Berlekamp–Massey based method (measure_bma, used for MPOLY_GCD_USE_ZIPPEL2) needs at least three variables and chooses two main variables of small degree that fit in half a word. measure_zippel2 is the analogue for the Zippel2 variant used by the nmod and fq_nmod modules.

Cite this page

The FLINT team, “mpoly_gcd_info_measure_hensel, mpoly_gcd_info_measure_brown, mpoly_gcd_info_measure_bma, mpoly_gcd_info_measure_zippel, mpoly_gcd_info_measure_zippel2 (mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/mpoly/mpoly_gcd_info_measure_hensel.html (generated 2026-10-20).