Beta
×

Welcome to the Slashdot Beta site -- learn more here. Use the link in the footer or click here to return to the Classic version of Slashdot.

Thank you!

Before you choose to head back to the Classic look of the site, we'd appreciate it if you share your thoughts on the Beta; your feedback is what drives our ongoing development.

Beta is different and we value you taking the time to try it out. Please take a look at the changes we've made in Beta and  learn more about it. Thanks for reading, and for making the site better!

Faster integer multiplication

origins (1116903) writes | more than 7 years ago

Math

origins (1116903) 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"

cancel ×

comment

Slashdot Login

Need an Account?

Forgot your password?