fq_poly_factor
#include <flint/fq_poly_factor.h>void fq_poly_factor(fq_poly_factor_t result, fq_t leading_coeff, const fq_poly_t input, const fq_ctx_t ctx)Factors input as with distinct monic irreducible : sets result to the factors and exponents (discarding previous contents) and leading_coeff to . For the zero polynomial and the factorisation is empty; for a constant, is the constant.
This is a wrapper of _gr_poly_factor_finite_field with the default algorithm. The polynomial is first deflated (written as a polynomial in for the largest possible ), then a squarefree factorisation is computed, and each squarefree factor is factored with the Cantor–Zassenhaus algorithm if its degree satisfies , and with the Kaltofen–Shoup algorithm otherwise. The factors of the deflated polynomial are then inflated and factored again.
The FLINT team, “fq_poly_factor (fq_poly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_poly_factor/fq_poly_factor.html (generated 2026-11-02).
@misc{flint-doc-fq-poly-factor-fq-poly-factor,
author = {{The FLINT team}},
title = {{fq\_poly\_factor (fq\_poly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_poly_factor/fq_poly_factor.html},
note = {Generated 2026-11-02}
}