nmod_mpolyu_gcdm_zippel, nmod_mpolyu_gcdp_zippel, nmod_mpolyu_gcds_zippel
Synopsis
#include <flint/nmod_mpoly.h>int nmod_mpolyu_gcdm_zippel(nmod_mpolyu_t G, nmod_mpolyu_t Abar, nmod_mpolyu_t Bbar, nmod_mpolyu_t A, nmod_mpolyu_t B, nmod_mpoly_ctx_t ctx, flint_rand_t randstate)sourceint nmod_mpolyu_gcdp_zippel(nmod_mpolyu_t G, nmod_mpolyu_t Abar, nmod_mpolyu_t Bbar, nmod_mpolyu_t A, nmod_mpolyu_t B, slong var, const nmod_mpoly_ctx_t ctx, flint_rand_t randstate)sourcenmod_gcds_ret_t nmod_mpolyu_gcds_zippel(nmod_mpolyu_t G, nmod_mpolyu_t A, nmod_mpolyu_t B, nmod_mpolyu_t f, slong var, const nmod_mpoly_ctx_t ctx, flint_rand_t randstate, slong * degbound)sourceZippel's sparse interpolation on nmod_mpolyu_t inputs. gcdp works with evaluation points in \mathbb{F}_p, gcds solves for the coefficients of an assumed monomial structure f by evaluating var variables and returns a status code (nmod_gcds_ret_t) that distinguishes success from bad evaluation points and a wrong form, and gcdm first tries gcdp and then falls back to images over \mathbb{F}_p[x_{m-1}]/(f) for irreducible f of increasing degree.
Cite this page
The FLINT team, “nmod_mpolyu_gcdm_zippel, nmod_mpolyu_gcdp_zippel, nmod_mpolyu_gcds_zippel (nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly/nmod_mpolyu_gcdm_zippel.html (generated 2026-10-20).
@misc{flint-doc-nmod-mpoly-nmod-mpolyu-gcdm-zippel,
author = {{The FLINT team}},
title = {{nmod\_mpolyu\_gcdm\_zippel, nmod\_mpolyu\_gcdp\_zippel, nmod\_mpolyu\_gcds\_zippel (nmod\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_mpoly/nmod_mpolyu_gcdm_zippel.html},
note = {Generated 2026-10-20}
}