<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fast Integer Multiplication using Modular Arithmetic · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0801.1416/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/0801.1416/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fast Integer Multiplication using Modular Arithmetic — mentioned by carterschonwald</title><link>https://news.ycombinator.com/item?id=4562113</link><guid isPermaLink="false">urn:hackerpapers:mention:0801.1416:4562113</guid><pubDate>Sun, 23 Sep 2012 21:24:37 GMT</pubDate><description>&lt;p&gt;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.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0801.1416/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SC</category></item></channel></rss>
