Re: Comparaison between PARI MPQS, PPMPQS and PPSIGS

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

On Wed, 27 Nov 2002, Bill Allombert wrote:
> I have factored
> 117433370311644622074182931512170893877890957626285922622753078073774028918529
> (78 digits)
>
> on a 1GHz PIV
> with PARI (2.2.5), and then I try PPMPQS (2.8) and PPSIGS (1.1) from
> http://www.asahi-net.or.jp/~KC2H-MSM/cn/
>
> here the running time:
> PARI   : 3h 9 min
> PPMPQS : 1h 58 min
> PPSIGS : 1h 46 min
>
> Karim's FAQ states
>
> > PARI's MPQS is about as fast as PPMPQS-2.7 in the 60 digits range, and much
> > slower afterwards, e.g already 3 times slower for 70 digits. We have not
> > tested mpqs4linux.
>
> but PARI performs better in this test.

I only tried a few  dummy factorizations, of the form
nextprime(10^n + k) * nextprime(10^n + l), for "small" l,k (about 5 for about
5 different n, I think. Can't find the relevant log anymore).

I'd be overjoyed to quote/include more serious/extensive benchmarks. Esp. if
PARI performs better than I thought :-).

    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             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/