<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Group-theoretic algorithms for matrix multiplication · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/math_0511460/</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_0511460/feed.xml" rel="self" type="application/rss+xml" /><item><title>Group-theoretic algorithms for matrix multiplication — mentioned by actually_a_dog</title><link>https://news.ycombinator.com/item?id=29603127</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0511460:29603127</guid><pubDate>Sat, 18 Dec 2021 09:28:10 GMT</pubDate><description>&lt;p&gt;Fortunately, there&amp;#x27;s another approach based on group theory that&amp;#x27;s able to hit n^2.41 and shows some promise. Here&amp;#x27;s the paper: https://arxiv.org/abs/math/0511460 Here&amp;#x27;s a set of lecture notes that are simpler to read and give an easy example of how group theoretic methods work: http://www.ccs.neu.edu/home/viola/classes/gems-08/lectures/l...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0511460/"&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>
