FLINT3.7.0-dev

fq_nmod_mpoly_gcd_brown, fq_nmod_mpoly_gcd_hensel, fq_nmod_mpoly_gcd_zippel, fq_nmod_mpoly_gcd_zippel2

Synopsis#include <flint/fq_nmod_mpoly.h>
int fq_nmod_mpoly_gcd_brown(fq_nmod_mpoly_t G, const fq_nmod_mpoly_t A, const fq_nmod_mpoly_t B, const fq_nmod_mpoly_ctx_t ctx)source
int fq_nmod_mpoly_gcd_hensel(fq_nmod_mpoly_t G, const fq_nmod_mpoly_t A, const fq_nmod_mpoly_t B, const fq_nmod_mpoly_ctx_t ctx)source
int fq_nmod_mpoly_gcd_zippel(fq_nmod_mpoly_t G, const fq_nmod_mpoly_t A, const fq_nmod_mpoly_t B, const fq_nmod_mpoly_ctx_t ctx)source
int fq_nmod_mpoly_gcd_zippel2(fq_nmod_mpoly_t G, const fq_nmod_mpoly_t A, const fq_nmod_mpoly_t B, const fq_nmod_mpoly_ctx_t ctx)source

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

Cite this page

The FLINT team, “fq_nmod_mpoly_gcd_brown, fq_nmod_mpoly_gcd_hensel, fq_nmod_mpoly_gcd_zippel, fq_nmod_mpoly_gcd_zippel2 (fq_nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_mpoly/fq_nmod_mpoly_gcd_brown.html (generated 2026-10-20).