FLINT3.7.0-dev

fmpz_mod_mpoly_gcd_brown, fmpz_mod_mpoly_gcd_hensel, fmpz_mod_mpoly_gcd_zippel, fmpz_mod_mpoly_gcd_zippel2, fmpz_mod_mpoly_gcd_subresultant

Synopsis#include <flint/fmpz_mod_mpoly.h>
int fmpz_mod_mpoly_gcd_brown(fmpz_mod_mpoly_t G, const fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_t B, const fmpz_mod_mpoly_ctx_t ctx)source
int fmpz_mod_mpoly_gcd_hensel(fmpz_mod_mpoly_t G, const fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_t B, const fmpz_mod_mpoly_ctx_t ctx)source
int fmpz_mod_mpoly_gcd_zippel(fmpz_mod_mpoly_t G, const fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_t B, const fmpz_mod_mpoly_ctx_t ctx)source
int fmpz_mod_mpoly_gcd_zippel2(fmpz_mod_mpoly_t G, const fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_t B, const fmpz_mod_mpoly_ctx_t ctx)source
int fmpz_mod_mpoly_gcd_subresultant(fmpz_mod_mpoly_t G, const fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_t B, const fmpz_mod_mpoly_ctx_t ctx)source

Set G to the monic GCD by one algorithm: Brown's dense interpolation, Hensel lifting, Zippel's sparse interpolation, sparse interpolation with two main variables, or the subresultant pseudo-remainder sequence in one variable. Return 0 if the algorithm cannot be applied.

Cite this page

The FLINT team, “fmpz_mod_mpoly_gcd_brown, fmpz_mod_mpoly_gcd_hensel, fmpz_mod_mpoly_gcd_zippel, fmpz_mod_mpoly_gcd_zippel2, fmpz_mod_mpoly_gcd_subresultant (fmpz_mod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_mpoly/fmpz_mod_mpoly_gcd_brown.html (generated 2026-10-20).