# Integer multiplication in time O(n log n)

**Speaker:**Joris van der Hoeven (Max team)

**Location:**Amphi Sophie Germain + https://inria.webex.com/inria/j.php?MTID=m0270b19d056bea68e6414df36ce4956b

**Date:**Thu, 22 Sep 2022, 13:00-14:00

Integer multiplication is one of the oldest mathematical operations and still a central problem for computer arithmetic. The complexities of many other basic operations such as division, base conversion, gcds, computing e and pi, FFTs, etc. can be expressed in terms of the complexity of integer multiplication. In our talk, we will survey a new algorithm for multiplying two n-digit integers in time O(n log n).

Joris van der Hoeven and David Harvey received the de Bruijn Medal 2022 for this work.