_fmpz_poly_sqrt_KS, fmpz_poly_sqrt_KS
Synopsis
#include <flint/fmpz_poly.h>int fmpz_poly_sqrt_KS(fmpz_poly_t b, const fmpz_poly_t a)sourceHeuristic square root by Kronecker substitution: after the same quick tests as the classical algorithm, the integer square root of a(2^k), for k a few bits more than the coefficients of a, is unpacked and checked. Return -1 if the heuristic is inconclusive, and otherwise 1 or 0 as fmpz_poly_sqrt.
Cite this page
The FLINT team, “_fmpz_poly_sqrt_KS, fmpz_poly_sqrt_KS (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/_fmpz_poly_sqrt_KS.html (generated 2026-10-20).
@misc{flint-doc-fmpz-poly-fmpz-poly-sqrt-KS,
author = {{The FLINT team}},
title = {{\_fmpz\_poly\_sqrt\_KS, fmpz\_poly\_sqrt\_KS (fmpz\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_poly/_fmpz_poly_sqrt_KS.html},
note = {Generated 2026-10-20}
}