n_bpoly_mod_factor_lgprime
Synopsis
#include <flint/nmod_mpoly_factor.h>As n_bpoly_mod_factor_smprime, but reduces y modulo irreducible polynomials m(y) of increasing degree, factors the image over \mathbb{F}_p[y]/(m) \cong \mathbb{F}_{p^d}, lifts m-adically and recombines. Always succeeds.
Cite this page
The FLINT team, “n_bpoly_mod_factor_lgprime (nmod_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly_factor/n_bpoly_mod_factor_lgprime.html (generated 2026-10-20).
@misc{flint-doc-nmod-mpoly-factor-n-bpoly-mod-factor-lgprime,
author = {{The FLINT team}},
title = {{n\_bpoly\_mod\_factor\_lgprime (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/n_bpoly_mod_factor_lgprime.html},
note = {Generated 2026-10-20}
}