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)$.
De George Labahn , Arne Storjohann
De George Labahn , Arne Storjohann
De George Labahn , Arne Storjohann
De George Labahn , Arne Storjohann
De George Labahn , Arne Storjohann
De George Labahn , Arne Storjohann
De George Labahn , Arne Storjohann
De George Labahn , Arne Storjohann
De Joris van der Hoeven
De Thibaut Delcroix
De Thibaut Delcroix
De Lorena López-Hernanz
De Lorena López-Hernanz
De Lorena López-Hernanz
![Efficient algorithms for integer and polynomial matrices - Part 3: Linear algebra over ℤ and K[𝑥]](/media/cache/video_light/uploads/video/Capture%20d%E2%80%99%C3%A9cran%202023-10-06%20%C3%A0%2011.46.14.png)
