_nmod_mpoly_gcd_algo, _nmod_mpoly_gcd_algo_small
Synopsis
#include <flint/nmod_mpoly.h>int _nmod_mpoly_gcd_algo(nmod_mpoly_t G, nmod_mpoly_t Abar, nmod_mpoly_t Bbar, const nmod_mpoly_t A, const nmod_mpoly_t B, const nmod_mpoly_ctx_t ctx, unsigned int algo)sourceint _nmod_mpoly_gcd_algo_small(nmod_mpoly_t G, nmod_mpoly_t Abar, nmod_mpoly_t Bbar, const nmod_mpoly_t A, const nmod_mpoly_t B, const nmod_mpoly_ctx_t ctx, unsigned int algo)sourceCompute the GCD G and, when Abar and Bbar are not NULL, the cofactors of the nonzero A and B, using the algorithms in the bit mask algo (MPOLY_GCD_USE_BROWN, MPOLY_GCD_USE_HENSEL, MPOLY_GCD_USE_ZIPPEL, MPOLY_GCD_USE_ZIPPEL2, or MPOLY_GCD_USE_ALL). The _small version requires exponents of at most FLINT_BITS bits. Return 1 for success.
Cite this page
The FLINT team, “_nmod_mpoly_gcd_algo, _nmod_mpoly_gcd_algo_small (nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly/_nmod_mpoly_gcd_algo.html (generated 2026-10-20).
@misc{flint-doc-nmod-mpoly-nmod-mpoly-gcd-algo,
author = {{The FLINT team}},
title = {{\_nmod\_mpoly\_gcd\_algo, \_nmod\_mpoly\_gcd\_algo\_small (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_mpoly_gcd_algo.html},
note = {Generated 2026-10-20}
}