On Sun, Nov 4, 2012 at 8:28 AM, Xavier Caruso
wrote:
> I realized that computing gcd and Bezout coefficients of polynomials
> of high degree over finite field is quite slow:
>
> sage: k. = GF(2^50)
> sage: A. = k[]
> sage: a = A.random_element(200)
> sage: b = A.random_element(199)
> sage: timeit(
I realized that computing gcd and Bezout coefficients of polynomials
of high degree over finite field is quite slow:
sage: k. = GF(2^50)
sage: A. = k[]
sage: a = A.random_element(200)
sage: b = A.random_element(199)
sage: timeit("d,u,v = a.xgcd(b)")
5 loops, best of 3: 15.6 s per loop
And it's a
