Re: polredabs() suggestion

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

On Mon, 28 Apr 2003, Igor Schein wrote:
> I was thinking, maybe it's a good idea to restart smallvectors() with
> a lower bound once a better generator is found, to shorten the sorting
> stage.

The current algorithm does this. Anytime a better generator is found, the bound
is updated, pruning the search tree.

    Karim.
-- 
Karim Belabas                     Tel: (+33) (0)1 69 15 57 48
Dép. de Mathématiques, Bât. 425   Fax: (+33) (0)1 69 15 60 19
Université Paris-Sud              http://www.math.u-psud.fr/~belabas/
F-91405 Orsay (France)            http://www.parigp-home.de/  [PARI/GP]