<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Ruling Out Low-rank Matrix Multiplication Tensor Decompositions with Symmetries via SAT · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2402.01011/</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/2402.01011/feed.xml" rel="self" type="application/rss+xml" /><item><title>Ruling Out Low-rank Matrix Multiplication Tensor Decompositions with Symmetries via SAT — mentioned by NooneAtAll3</title><link>https://news.ycombinator.com/item?id=39636297</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.01011:39636297</guid><pubDate>Fri, 08 Mar 2024 00:26:24 GMT</pubDate><description>&lt;p&gt;pretty much all progress in theoretical matmul comes from approximate decomposition tools, so results happen only when error is small enough to get fixed easily - on large multiplications on the small side even optimal (3x3)(3x3) matmul is unknown more precisely than &amp;quot;between 19 and 23&amp;quot; - with only tiny progress lately in ruling out some symmetrical solutions (https://arxiv.org/html/2402.01011v1)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.01011/"&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>
