Re: nffactor() slowdown

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

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.

(hence totally split polynomials ?)

Does nfroots suffer from the same problem ?

Can you post a few representative examples ?

    Karim.

P.S: it could be due to the change of bound for the coefficient size (from
Beauzamy back to Mignotte).
-- 
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/