FLINT3.7.0-dev
/

nmod_mpolyn_gcd_brown_smprime, nmod_mpolyn_gcd_brown_smprime_threaded_pool, nmod_mpolyn_gcd_brown_smprime_bivar, nmod_mpolyn_gcd_brown_lgprime

Synopsis#include <flint/nmod_mpoly.h>
int nmod_mpolyn_gcd_brown_smprime(nmod_mpolyn_t G, nmod_mpolyn_t Abar, nmod_mpolyn_t Bbar, nmod_mpolyn_t A, nmod_mpolyn_t B, slong var, const nmod_mpoly_ctx_t ctx, const mpoly_gcd_info_t Iv, nmod_poly_stack_t Sp)source
int nmod_mpolyn_gcd_brown_smprime_threaded_pool(nmod_mpolyn_t G, nmod_mpolyn_t Abar, nmod_mpolyn_t Bbar, nmod_mpolyn_t A, nmod_mpolyn_t B, slong var, const nmod_mpoly_ctx_t ctx, const mpoly_gcd_info_t Iv, const thread_pool_handle * handles, slong num_workers)source
int nmod_mpolyn_gcd_brown_smprime_bivar(nmod_mpolyn_t G, nmod_mpolyn_t Abar, nmod_mpolyn_t Bbar, nmod_mpolyn_t A, nmod_mpolyn_t B, const nmod_mpoly_ctx_t ctx, nmod_poly_stack_t Sp)source
int nmod_mpolyn_gcd_brown_lgprime(nmod_mpolyn_t G, nmod_mpolyn_t Abar, nmod_mpolyn_t Bbar, nmod_mpolyn_t A, nmod_mpolyn_t B, slong var, const nmod_mpoly_ctx_t ctx)source

Brown's dense algorithm on nmod_mpolyn_t inputs: evaluation of the variable of index var at points of \mathbb{F}_p (smprime), or reduction modulo irreducible polynomials of increasing degree in it (lgprime), recursion, and interpolation with a degree-based termination test. Return 1 for success, also setting the cofactors.

Cite this page

The FLINT team, “nmod_mpolyn_gcd_brown_smprime, nmod_mpolyn_gcd_brown_smprime_threaded_pool, nmod_mpolyn_gcd_brown_smprime_bivar, nmod_mpolyn_gcd_brown_lgprime (nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly/nmod_mpolyn_gcd_brown_smprime.html (generated 2026-10-20).