mpoly_univar_pseudo_gcd_ducos
Synopsis
#include <flint/mpoly.h>int mpoly_univar_pseudo_gcd_ducos(mpoly_univar_t G, mpoly_univar_t B, mpoly_univar_t A, mpoly_void_ring_t R)sourceSets G to the last nonzero subresultant of B and A, computed with Ducos' algorithm [Duc2000], which divides out the predictable factors of the subresultant sequence early. Requires \deg B \ge \deg A \ge 0 and nonzero inputs; A and B are destroyed. Returns 0 if a ring operation failed (for example an exponent overflow in a power), 1 otherwise.
References#
- [Duc2000] L. Ducos. Optimizations of the subresultant algorithm. Journal of Pure and Applied Algebra 145 (2000), 149–163. https://doi.org/10.1016/S0022-4049(98)00081-4
Cite this page
The FLINT team, “mpoly_univar_pseudo_gcd_ducos (mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/mpoly/mpoly_univar_pseudo_gcd_ducos.html (generated 2026-10-20).
@misc{flint-doc-mpoly-mpoly-univar-pseudo-gcd-ducos,
author = {{The FLINT team}},
title = {{mpoly\_univar\_pseudo\_gcd\_ducos (mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/mpoly/mpoly_univar_pseudo_gcd_ducos.html},
note = {Generated 2026-10-20}
}