Nuacht

GitHubLíon na míonna: 4

Using PARI's gcd/gcdext function for Polynomials' gcd/xgcd on modulus ring

Polynomials defined on Rings with FLINT has gcd/xgcd method function well implemented, and internally uses half-gcd algorithm as well for fast calculation. However, if the modulus exceeds 2^63 - 1, ...