FLINT3.7.0-dev

fq_nmod_mpolyu_gcdm_zippel, fq_nmod_mpolyu_gcdp_zippel, fq_nmod_mpolyu_gcdp_zippel_univar, fq_nmod_mpolyu_gcdp_zippel_univar_no_cofactors, fq_nmod_mpolyu_gcds_zippel

Synopsis#include <flint/fq_nmod_mpoly.h>
int fq_nmod_mpolyu_gcdp_zippel(fq_nmod_mpolyu_t G, fq_nmod_mpolyu_t Abar, fq_nmod_mpolyu_t Bbar, fq_nmod_mpolyu_t A, fq_nmod_mpolyu_t B, slong var, const fq_nmod_mpoly_ctx_t ctx, flint_rand_t randstate)source
int fq_nmod_mpolyu_gcdp_zippel_univar(fq_nmod_mpolyu_t G, fq_nmod_mpolyu_t Abar, fq_nmod_mpolyu_t Bbar, fq_nmod_mpolyu_t A, fq_nmod_mpolyu_t B, const fq_nmod_mpoly_ctx_t ctx)source
int fq_nmod_mpolyu_gcdp_zippel_univar_no_cofactors(fq_nmod_mpolyu_t G, fq_nmod_mpolyu_t A, fq_nmod_mpolyu_t B, const fq_nmod_mpoly_ctx_t ctx)source
nmod_gcds_ret_t fq_nmod_mpolyu_gcds_zippel(fq_nmod_mpolyu_t G, fq_nmod_mpolyu_t A, fq_nmod_mpolyu_t B, fq_nmod_mpolyu_t f, slong var, const fq_nmod_mpoly_ctx_t ctx, flint_rand_t randstate, slong * degbound)source

Zippel's sparse interpolation on fq_nmod_mpolyu_t: gcdp with points in \mathbb{F}_q (the univar versions for the base case of one main variable, with or without cofactors), gcds solving for the coefficients of the assumed form f, and gcdm trying gcdp first and then images over extensions \mathbb{F}_{q^n} chosen by an embedding chooser.

Cite this page

The FLINT team, “fq_nmod_mpolyu_gcdm_zippel, fq_nmod_mpolyu_gcdp_zippel, fq_nmod_mpolyu_gcdp_zippel_univar, fq_nmod_mpolyu_gcdp_zippel_univar_no_cofactors, fq_nmod_mpolyu_gcds_zippel (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_mpolyu_gcdm_zippel.html (generated 2026-10-20).