4 citations · 5 across the 3 of their papers we have counts for
1 paper · 1 filter
Peyman Afshani, Casper Benjamin Freksen, Lior Kamma +1
Multiplication is one of the most fundamental computational problems, yet its true complexity remains elusive. The best known upper bound, by Fürer, shows that two n-bit numbers…