Re: nffactor() slowdown

[Karim BELABAS <Karim.Belabas@math.u-psud.fr>]

On Wed, 19 Jun 2002, Igor Schein wrote:
> On Wed, Jun 19, 2002 at 05:33:58PM +0200, Karim BELABAS wrote:
> > On Tue, 18 Jun 2002, Igor Schein wrote:
> > > I compared nffactor's speed between 2.2.3 and 2.2.4, and latter
> > > is on average 10-25% slower on the type of polynomials I tried - large
> > > Galois polynomials over cyclotomic or quarternion fields.
[...]
> > Can you post a few representative examples ?
>
> You can use this one, after the bug is fixed, or any of the 2 I've
> posted during the last week on the list:
[...]
>   ***   bug in LLL_cmbf [no factor], please report

I've put back Beauzamy's bound (over Z also) [ you get to see the two bounds,
Mignotte's and Beauzamy's at \g3, before the min of the two is taken ].

So nffactor should be back to normal (possibly faster).

Cheers,

    Karim.
-- 
Karim Belabas                    Tel: (+33) (0)1 69 15 57 48
Dép. de Mathematiques, Bat. 425  Fax: (+33) (0)1 69 15 60 19
Université Paris-Sud             Email: Karim.Belabas@math.u-psud.fr
F-91405 Orsay (France)           http://www.math.u-psud.fr/~belabas/
--
PARI/GP Home Page: http://www.parigp-home.de/