Re: Memory use when factoring big polynomials

Ilya Zakharevich on Thu, 5 Nov 1998 00:13:50 -0500 (EST)

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: Memory use when factoring big polynomials

To: igor@txc.com
Subject: Re: Memory use when factoring big polynomials
From: Ilya Zakharevich <ilya@math.ohio-state.edu>
Date: Thu, 5 Nov 1998 00:13:50 -0500 (EST)
Cc: pari-dev@list.cr.yp.to (pari-dev@list.cr.yp.to)
In-reply-to: <19981104190120.Z18299@io.txc.com> from "Igor Schein" at Nov 04, 1998 07:01:20 PM

Igor Schein writes:
> I must say polynomial factorization has improved dramatically from
> 2.0.11 to upcoming 2.0.12.  Right now, there're only 2 other packages
> ( and I've tried them many ) which beat PARI by a factor of several.

You mean that there are only two packages which can factor x^2 - y^2? :-(

Ilya

Follow-Ups:
- Re: Memory use when factoring big polynomials
  - From: Karim BELABAS <Karim.Belabas@math.u-psud.fr>

References:
- Re: Memory use when factoring big polynomials
  - From: Igor Schein <igor@txc.com>

Prev by Date: Latest version of GP for DOS
Next by Date: Re: Memory use when factoring big polynomials
Previous by thread: Re: Memory use when factoring big polynomials
Next by thread: Re: Memory use when factoring big polynomials
Index(es):
- Date
- Thread