Re: polredabs() suggestion

[Igor Schein <igor@txc.com>]

On Mon, Apr 28, 2003 at 09:59:10PM +0200, Karim BELABAS wrote:
> On Mon, 28 Apr 2003, Igor Schein wrote:
> > On Mon, Apr 28, 2003 at 04:26:01PM +0200, Karim BELABAS wrote:
> >> 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.

[snip]

> P.S: I could "mark" the previous generator, so that the check is not done
> many times on the same element, and it is just accepted as is, provided it
> passes the test once. With current settings that means < 0.5% savings. I
> didn't bother.
> -- 
> Karim Belabas                     Tel: (+33) (0)1 69 15 57 48

I feel very strongly that this would show a significant improvement on
the polynomials I've had problems with, e.g.

x^8-97418273277417164826810*x^4-97418273278115084139045*x^2+97418273278115084139045

( from one of my older postings ).

So if there's no performance penalty for an average case ( which I
don't forsee ), it's a change I would more than welcome.

Igor