News for hackers. Stuff that matters.
Re:Toom–Cook multiplication by carterschonwald on Sunday September 23, 2012 @05:24PM (#4562113)
For an even faster algorithm, http://arxiv.org/pdf/0801.1416v3.pdf and its prequel http://www.cse.psu.edu/~furer/Papers/mult.pdf both beat strassen.
Re:Toom–Cook multiplication by wbhart on Sunday September 23, 2012 @07:31PM (#4562510)
I don't think this is terrible practical. Just as SSA wasn't efficient until the advent of modern computers and for integers of about millions of bits, so Furer's algorithm probably isn't efficient until integers are so large that their number of bits takes million of bits to write down. I won't say never, but it isn't going to be practical any century soon.

The multimodular version is likewise pretty useless in practice.

Re:Toom–Cook multiplication by carterschonwald on Thursday September 27, 2012 @05:04PM (#4582895)
in practice, certainly! The devil's in those constant factors etc :)