On Jan 21, 1:39 am, William Stein wrote:
> On Tue, Jan 20, 2009 at 9:59 PM, sea2...@gmail.com wrote:
>
> > Hi,
> > I want compute gcd(f,g), where f and g are polynomials and their
> > degree are huge, e.g. deg(f) is about 2^300.
> > I looked through the Sage reference manual, and learned th
On Wed, Jan 21, 2009 at 1:41 AM, Harald Schilly
wrote:
>
> I don't know what's the fastes way or if i'm using ntl, but here is
> what i did:
> http://sagenb.org:8000/home/pub/167/
Those polynomials have degree 300 and 310. The original poster
wants to work with polynomials of degree 2^300 and 2
I don't know what's the fastes way or if i'm using ntl, but here is
what i did:
http://sagenb.org:8000/home/pub/167/
h
On Jan 21, 6:59 am, "sea2...@gmail.com" wrote:
> Hi,
> I want compute gcd(f,g), where f and g are polynomials and their
> degree are huge, e.g. deg(f) is about 2^300.
>I
On Tue, Jan 20, 2009 at 9:59 PM, sea2...@gmail.com wrote:
>
> Hi,
> I want compute gcd(f,g), where f and g are polynomials and their
> degree are huge, e.g. deg(f) is about 2^300.
> I looked through the Sage reference manual, and learned that NTL
> is a library of fast arithmetic with polyno
