SFU Discrete Math Seminar: Joris van der Hoeven

  • Date: 01/21/2020
  • Time: 13:30
Joris van der Hoeven, CNRS

Simon Fraser University


Integer multiplication in time O(n log n)


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.

Other Information: 

Location: SFU Burnaby, Room SCK 9509