Follow Slashdot stories on Twitter

 



Forgot your password?
typodupeerror
Math

+ - Faster integer multiplication

Submitted by origins
origins writes: On the STOC 2007,thesis about faster integer multiplication was submitted. According to the thesis,multiplication can be calculated faster than ever. Schönhage&Strassen algorithm was known as fastest(O(n log n log log n)) but now Martin Fürer algorithm was((n log n 2^O(log* n)). improvement of multiplication algorithm after decades is quite interesting.
Martin Fürer's homepage
The thesis

If I have not seen as far as others, it is because giants were standing on my shoulders. -- Hal Abelson

Working...