General audience presentation - Integer multiplication in time $O(n \log n)$ | Vidéo

General audience presentation - Integer multiplication in time $O(n \log n)$

Appears in collection : 2023 - T3 - WS1 - Special Week

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)$.

Information about the video

Date of recording 20/09/2023
Date of publication 20/09/2023
Institution IHP
Licence CC BY-NC-ND
Language English
Audience Researchers, Graduate Students, Students
Director(s) Alexandre Duplessis
Format MP4
Venue IHP - Hermite Amphitheater

Citation data

DOI 10.57987/IHP.2023.T3.WS1.SW.003
Cite this video van der Hoeven, Joris (20/09/2023). General audience presentation - Integer multiplication in time $O(n \log n)$. IHP. Audiovisual resource. DOI: 10.57987/IHP.2023.T3.WS1.SW.003
URL https://dx.doi.org/10.57987/IHP.2023.T3.WS1.SW.003