D. Harvey and Van Der Hoeven claim to have found the first O(nlog n) integer multiplication algorithm. The prevailing 50 year old conjecture has always been that an optimal algorithm is O(n log n) but no one had been able to find it.
— Fermat's Library (@fermatslibrary) March 28, 2019
Discovery Paper: https://t.co/dXsG8Ece4i pic.twitter.com/Vfi89WDH1Z
from Twitter https://twitter.com/fermatslibrary
March 28, 2019 at 05:41AM
via IFTTT
No comments:
Post a Comment