nmod_mpolyl_gcdp_zippel_smprime, nmod_mpolyl_gcds_zippel
Synopsis
#include <flint/nmod_mpoly_factor.h>int nmod_mpolyl_gcdp_zippel_smprime(nmod_mpoly_t G, nmod_mpoly_t Abar, nmod_mpoly_t Bbar, nmod_mpoly_t A, nmod_mpoly_t B, slong var, const nmod_mpoly_ctx_t ctx, flint_rand_t state)sourceint nmod_mpolyl_gcds_zippel(nmod_mpoly_t G, const ulong * Gmarks, slong Gmarkslen, nmod_mpoly_t A, nmod_mpoly_t B, slong *perm, slong l, slong var, const nmod_mpoly_ctx_t ctx, flint_rand_t state, slong * Gdegbound, n_poly_t Amarks, n_poly_t Bmarks)sourceZippel's GCD algorithm in a lexicographic context, as used by the factoring code: gcdp interpolates the variables up to var with points in \mathbb{F}_p, gcds solves for the coefficients of the assumed monomial structure G (marked by Gmarks).
Cite this page
The FLINT team, “nmod_mpolyl_gcdp_zippel_smprime, nmod_mpolyl_gcds_zippel (nmod_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly_factor/nmod_mpolyl_gcdp_zippel_smprime.html (generated 2026-10-20).
@misc{flint-doc-nmod-mpoly-factor-nmod-mpolyl-gcdp-zippel-smprime,
author = {{The FLINT team}},
title = {{nmod\_mpolyl\_gcdp\_zippel\_smprime, nmod\_mpolyl\_gcds\_zippel (nmod\_mpoly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_mpoly_factor/nmod_mpolyl_gcdp_zippel_smprime.html},
note = {Generated 2026-10-20}
}