fmpz_mod_poly_factor_cantor_zassenhaus, fmpz_mod_poly_factor_berlekamp, fmpz_mod_poly_factor_kaltofen_shoup
Synopsis
#include <flint/fmpz_mod_poly_factor.h>void fmpz_mod_poly_factor_cantor_zassenhaus(fmpz_mod_poly_factor_t res, const fmpz_mod_poly_t f, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_factor_berlekamp(fmpz_mod_poly_factor_t factors, const fmpz_mod_poly_t f, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_factor_kaltofen_shoup(fmpz_mod_poly_factor_t res, const fmpz_mod_poly_t poly, const fmpz_mod_ctx_t ctx)sourceLike fmpz_mod_poly_factor, but split the squarefree factors with the Cantor–Zassenhaus algorithm, Berlekamp's algorithm or the Kaltofen–Shoup algorithm respectively (deflation is still applied). The output is overwritten.
Cite this page
The FLINT team, “fmpz_mod_poly_factor_cantor_zassenhaus, fmpz_mod_poly_factor_berlekamp, fmpz_mod_poly_factor_kaltofen_shoup (fmpz_mod_poly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly_factor/fmpz_mod_poly_factor_cantor_zassenhaus.html (generated 2026-11-02).
@misc{flint-doc-fmpz-mod-poly-factor-fmpz-mod-poly-factor-cantor-zassenhaus,
author = {{The FLINT team}},
title = {{fmpz\_mod\_poly\_factor\_cantor\_zassenhaus, fmpz\_mod\_poly\_factor\_berlekamp, fmpz\_mod\_poly\_factor\_kaltofen\_shoup (fmpz\_mod\_poly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly_factor/fmpz_mod_poly_factor_cantor_zassenhaus.html},
note = {Generated 2026-11-02}
}