<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1810.08671/</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/1810.08671/feed.xml" rel="self" type="application/rss+xml" /><item><title>Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication — mentioned by thomasahle</title><link>https://news.ycombinator.com/item?id=26560334</link><guid isPermaLink="false">urn:hackerpapers:mention:1810.08671:26560334</guid><pubDate>Tue, 23 Mar 2021 21:00:13 GMT</pubDate><description>&lt;p&gt;If you are interested in how those tensor methods work, the authors have another very nice paper that gives a great introduction https://arxiv.org/abs/1810.08671 It is actually not that different from Strassen after all. It just uses a bit more notation to help construct more clever ways of saving multiplication.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1810.08671/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item></channel></rss>
