Bill Allombert on Tue, 02 Feb 2010 13:06:55 +0100

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: ellap hangs on a large-ish prime

On Tue, Feb 02, 2010 at 11:47:28AM +0100, Johan Brinch wrote:
> Take a look at:
> It states that versions prior to 2.4.3 uses an algorithm that can use
> exponential running time on some primes.

Precisely: Version 2.4.3 include an implementation of SEA which run
polynomial time, however for a small prime like 2486152157 it still
use the older algorithm, so this is unrelated.