<html><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; ">
<br><div><div>On May 12, 2009, at 4:04 PM, Aleksey Bader wrote:</div><br class="Apple-interchange-newline"><blockquote type="cite">P.S. Reletevly recent, Martin Furer <a href="http://www.cse.psu.edu/%7Efurer/Papers/mult.pdf" target="_blank">published</a> new multiplication algorithm with very low asymptotic complexity.<br> Q3. Any known (tries of) implementions (in GMP O:)? Maybe someone think about it (disregard to author's claim that his method outperforms Schönhage-Strassen on "astonomically large numbers" :-) )?</blockquote><div><br></div><div>Dan Bernstein has some notes on this, he seems to think it could be practical:</div><div><br></div><div><div style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; "><a href="http://www.nabble.com/fuerer-multiplication-td10235943.html">http://www.nabble.com/fuerer-multiplication-td10235943.html</a></div><div style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; "><br></div><div style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; ">david</div><div style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; "><br></div></div></div></body></html>