_fq_nmod_mpoly_gcd_algo
Synopsis
#include <flint/fq_nmod_mpoly.h>int _fq_nmod_mpoly_gcd_algo(fq_nmod_mpoly_t G, fq_nmod_mpoly_t Abar, fq_nmod_mpoly_t Bbar, const fq_nmod_mpoly_t A, const fq_nmod_mpoly_t B, const fq_nmod_mpoly_ctx_t ctx, unsigned int algo)sourceComputes the GCD G and, if Abar and Bbar are not NULL, the cofactors of the nonzero A and B with the algorithms in the bit mask algo (the MPOLY_GCD_USE_ constants). Returns 1 for success.
Cite this page
The FLINT team, “_fq_nmod_mpoly_gcd_algo (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_algo.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-mpoly-fq-nmod-mpoly-gcd-algo,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_mpoly\_gcd\_algo (fq\_nmod\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_mpoly/_fq_nmod_mpoly_gcd_algo.html},
note = {Generated 2026-10-20}
}