fq_zech_mpoly_factor, fq_zech_mpoly_factor_zassenhaus, fq_zech_mpoly_factor_wang, fq_zech_mpoly_factor_zippel, fq_zech_mpoly_factor_algo
Synopsis
#include <flint/fq_zech_mpoly_factor.h>int fq_zech_mpoly_factor(fq_zech_mpoly_factor_t f, const fq_zech_mpoly_t A, const fq_zech_mpoly_ctx_t ctx)sourceint fq_zech_mpoly_factor_zassenhaus(fq_zech_mpoly_factor_t f, const fq_zech_mpoly_t A, const fq_zech_mpoly_ctx_t ctx)sourceint fq_zech_mpoly_factor_wang(fq_zech_mpoly_factor_t f, const fq_zech_mpoly_t A, const fq_zech_mpoly_ctx_t ctx)sourceint fq_zech_mpoly_factor_zippel(fq_zech_mpoly_factor_t f, const fq_zech_mpoly_t A, const fq_zech_mpoly_ctx_t ctx)sourceint fq_zech_mpoly_factor_algo(fq_zech_mpoly_factor_t f, const fq_zech_mpoly_t A, const fq_zech_mpoly_ctx_t ctx, unsigned int algo)sourceSet f to the factorisation of A into monic irreducible factors, with the constant equal to the leading coefficient of A, using all methods, one lifting method, or the methods in the bit mask algo (see fq_nmod_mpoly_factor_algo). The computation is done by fq_nmod_mpoly_factor_algo after conversion. Return 1 for success.
Cite this page
The FLINT team, “fq_zech_mpoly_factor, fq_zech_mpoly_factor_zassenhaus, fq_zech_mpoly_factor_wang, fq_zech_mpoly_factor_zippel, fq_zech_mpoly_factor_algo (fq_zech_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_zech_mpoly_factor/fq_zech_mpoly_factor.html (generated 2026-10-20).
@misc{flint-doc-fq-zech-mpoly-factor-fq-zech-mpoly-factor,
author = {{The FLINT team}},
title = {{fq\_zech\_mpoly\_factor, fq\_zech\_mpoly\_factor\_zassenhaus, fq\_zech\_mpoly\_factor\_wang, fq\_zech\_mpoly\_factor\_zippel, fq\_zech\_mpoly\_factor\_algo (fq\_zech\_mpoly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_zech_mpoly_factor/fq_zech_mpoly_factor.html},
note = {Generated 2026-10-20}
}