3-prime FFT

paul zimmermann Paul.Zimmermann at inria.fr
Thu Jul 16 10:59:29 UTC 2015

Previous message (by thread): sqrt algorithm
Next message (by thread): 3-prime FFT
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

on https://hal.archives-ouvertes.fr/hal-01022383, page 27, table 16, the
3-prime FFT implemented in Mathemagix is faster than GMP for 2^23 to 2^25 bits.

Paul

Previous message (by thread): sqrt algorithm
Next message (by thread): 3-prime FFT
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

More information about the gmp-devel mailing list