The Institut Henri Poincaré welcomes Joris van der Hoeven, directeur de recherche CNRS, head of the MAX team of the Laboratoire d'informatique de l'École polytechnique, as part of the special week "Fundamental Algorithms and Algorithmic Complexity".
This presentation will be held Wednesday, September 20th at 4:00 pm in the Amphitheater Hermite, IHP, Paris. It will be available on streaming.
Do not hesitate to spread the word and forward this e-mail to potentially interested colleagues and junior researchers including Ph.D. students and postdocs.
Abstract. 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).
This event is part of the thematic three-month programme "Recent Trends in Computer Algebra" organised by Alin Bostan, Mark Giesbrecht, Christoph Koutschan, Marni Mishna, Mohab Safey El Din, Bruno Salvy, Gilles Villard at the Institut Henri Poincaré (IHP) in Paris from September 18 to December 12, 2023.
