<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A group-theoretic approach to fast matrix multiplication · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/math_0307321/</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/math_0307321/feed.xml" rel="self" type="application/rss+xml" /><item><title>A group-theoretic approach to fast matrix multiplication — mentioned by pbsd</title><link>https://news.ycombinator.com/item?id=9191090</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0307321:9191090</guid><pubDate>Thu, 12 Mar 2015 14:46:03 GMT</pubDate><description>&lt;p&gt;I was puzzled as well. There is an analogous of the FFT method of multiplying polynomials and integers to the matrix multiplication case [1], but it is not as simple and probably does not belong in an introduction to linear algebra. [1] http://arxiv.org/abs/math/0307321v2&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0307321/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.GR</category></item></channel></rss>
