Historic algorithms for integer multiplication.

Joris van der Hoven, Laboratoire d'informatique de l'École polytechnique, Paris.

Tuesday January 21st, 1:30pm in K 9509.

Abstract:

In this first talk of two, I will review various well-known algorithms for 
integer multiplication, such as schoolbook multiplication, Karatsuba multiplication, 
FFT multiplication, and the Schoenhage-Strassen algorithm.
The talk will also be an occasion to survey various basic 
techniques that will be useful for the second talk.