fmpz_mod_mpoly_factor_irred_smprime_zassenhaus, fmpz_mod_mpoly_factor_irred_smprime_wang, fmpz_mod_mpoly_factor_irred_smprime_zippel
Synopsis
#include <flint/fmpz_mod_mpoly_factor.h>int fmpz_mod_mpoly_factor_irred_smprime_zassenhaus(fmpz_mod_mpolyv_t fac, const fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_ctx_t ctx, flint_rand_t state)sourceint fmpz_mod_mpoly_factor_irred_smprime_wang(fmpz_mod_mpolyv_t fac, const fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_factor_t lcAfac, const fmpz_mod_mpoly_t lcA, const fmpz_mod_mpoly_ctx_t ctx, flint_rand_t state)sourceint fmpz_mod_mpoly_factor_irred_smprime_zippel(fmpz_mod_mpolyv_t fac, const fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_factor_t lcAfac, const fmpz_mod_mpoly_t lcA, const fmpz_mod_mpoly_ctx_t ctx, flint_rand_t state)sourceIrreducible factorisation of a monic squarefree polynomial in at least three variables with evaluation points in . Return 1 for success, 0 if they ran out of evaluation points and for a failure that other points would not fix.
Cite this page
The FLINT team, “fmpz_mod_mpoly_factor_irred_smprime_zassenhaus, fmpz_mod_mpoly_factor_irred_smprime_wang, fmpz_mod_mpoly_factor_irred_smprime_zippel (fmpz_mod_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_mpoly_factor/fmpz_mod_mpoly_factor_irred_smprime_zassenhaus.html (generated 2026-11-02).
@misc{flint-doc-fmpz-mod-mpoly-factor-fmpz-mod-mpoly-factor-irred-smprime-zassenhaus,
author = {{The FLINT team}},
title = {{fmpz\_mod\_mpoly\_factor\_irred\_smprime\_zassenhaus, fmpz\_mod\_mpoly\_factor\_irred\_smprime\_wang, fmpz\_mod\_mpoly\_factor\_irred\_smprime\_zippel (fmpz\_mod\_mpoly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_mpoly_factor/fmpz_mod_mpoly_factor_irred_smprime_zassenhaus.html},
note = {Generated 2026-11-02}
}