In this first talk out 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.
Additional Information
Location: SFU Burnaby, Room SCK 9509 Joris van der Hoeven, CNRS