Please create an account to participate in the Slashdot moderation system

 



Forgot your password?
typodupeerror
Check out the new SourceForge HTML5 internet speed test! No Flash necessary and runs on all devices. ×
Math

Submission + - Faster integer multiplication

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

What this country needs is a dime that will buy a good five-cent bagel.

Working...