[][src]Function libslide::math::gcd_poly_zz::gcd_poly_zz_heu

pub fn gcd_poly_zz_heu(
    f: Poly,
    g: Poly
) -> Result<(Poly, Poly, Poly), &'static str>

Calculates the GCD of two polynomials, f and g, in ZZ (integer, integer) space using the GCDHEU heuristic algorithm (sources: 1, 2).

If successful, the algorithm returns the tuple (gcd, f_quotient, g_quotient). If the algorithm fails (either because the heuristic terminates or another reason) an error is returned.