| Karim.Belabas on Mon, 9 Apr 2001 18:59:27 +0200 (MET DST) |
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
| Re: nffactor() memory infefficiency |
On Fri, 6 Apr 2001, Bill Allombert wrote:
> On Wed, Dec 20, 2000 at 01:23:51PM -0500, Igor Schein wrote:
> > Hi,
> >
> > the following command needs at least 180MB of stack
> > to complete:
> >
> > nffactor(nfinit(y^3+y^2+2),x^24+69)
> >
> > I don't see a reason why this has to be a *tough* case. Running it at
> > \gm20 doesn't show all the memory allocation, so it's possible that there's a
> > memory leak. I'm using latest CVS version.
> >
>
> It works fine with 2.2.0 . Will the fix be backported to 2.1.x ?
Yes [was not checking enough prime ideals during the modular factorization
part].
Karim.
--
Karim Belabas email: Karim.Belabas@math.u-psud.fr
Dep. de Mathematiques, Bat. 425
Universite Paris-Sud Tel: (00 33) 1 69 15 57 48
F-91405 Orsay (France) Fax: (00 33) 1 69 15 60 19
--
PARI/GP Home Page: http://www.parigp-home.de/