_fmpz_mod_poly_minpoly, fmpz_mod_poly_minpoly
Synopsis
#include <flint/fmpz_mod_poly.h>slong _fmpz_mod_poly_minpoly(fmpz * poly, const fmpz * seq, slong len, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_minpoly(fmpz_mod_poly_t poly, const fmpz * seq, slong len, const fmpz_mod_ctx_t ctx)sourceSet poly to a minimal generating polynomial of (seq, len), choosing the Berlekamp–Massey algorithm for \mathit{len} < \max(200, 530 - 22s), s being the number of limbs of the modulus, and the half-GCD algorithm otherwise. The underscore version needs space for \mathit{len} + 1 coefficients, returns the length of poly and does not allow aliasing.
Cite this page
The FLINT team, “_fmpz_mod_poly_minpoly, fmpz_mod_poly_minpoly (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_minpoly.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-minpoly,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_minpoly, fmpz\_mod\_poly\_minpoly (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_minpoly.html},
note = {Generated 2026-10-20}
}