FLINT3.7.0-dev

fmpz_mod_polyu1n_gcd_brown_smprime, fmpz_mod_mpolyn_gcd_brown_smprime, fmpz_mod_mpolyl_gcdp_zippel, fmpz_mod_mpolyl_gcd_zippel2_smprime, fmpz_mod_mpolyl_gcd_hensel_smprime

Synopsis#include <flint/fmpz_mod_mpoly_factor.h>
int fmpz_mod_mpolyl_gcdp_zippel(fmpz_mod_mpoly_t G, fmpz_mod_mpoly_t Abar, fmpz_mod_mpoly_t Bbar, fmpz_mod_mpoly_t A, fmpz_mod_mpoly_t B, slong var, const fmpz_mod_mpoly_ctx_t ctx, flint_rand_t state)source
int fmpz_mod_mpolyl_gcd_zippel2_smprime(fmpz_mod_mpoly_t rG, const slong * rGdegs, fmpz_mod_mpoly_t rAbar, fmpz_mod_mpoly_t rBbar, const fmpz_mod_mpoly_t A, const slong * Adegs, const fmpz_mod_mpoly_t B, const slong * Bdegs, const fmpz_mod_mpoly_t gamma, const slong * gammadegs, const fmpz_mod_mpoly_ctx_t ctx)source
int fmpz_mod_mpolyl_gcd_hensel_smprime(fmpz_mod_mpoly_t G, slong Gdeg, fmpz_mod_mpoly_t Abar, fmpz_mod_mpoly_t Bbar, const fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_t B, const fmpz_mod_mpoly_ctx_t ctx)source

The GCD algorithms with evaluation points in \mathbb{F}_p: Brown's dense algorithm (bivariate and multivariate), Zippel's algorithm in the variables up to var, sparse interpolation with two main variables given the leading coefficient of the GCD, and Hensel lifting. Return 1 for success, also setting the cofactors.

Cite this page

The FLINT team, “fmpz_mod_polyu1n_gcd_brown_smprime, fmpz_mod_mpolyn_gcd_brown_smprime, fmpz_mod_mpolyl_gcdp_zippel, fmpz_mod_mpolyl_gcd_zippel2_smprime, fmpz_mod_mpolyl_gcd_hensel_smprime (fmpz_mod_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_mpoly_factor/fmpz_mod_polyu1n_gcd_brown_smprime.html (generated 2026-10-20).