Historical algorithms for integer multiplication


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.

Occasion: discrete math seminar, SFU, Burnaby, Canada, January 21, 2020

Documents: slideshow, TeXmacs source