![]() |
HomepagePublicationsTalksTeXmacsMathemagix |
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 and
, 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
-digit
integers in time
.
Note: Joint work with David
Occasion: invited general audience presentation at RTCA 2023, IHP, Paris, September 20, 2023
Documents: slideshow, TeXmacs source