An $O(n^2\log^4 n \log \log n)$ Time Matrix Multiplication Algorithm · HackerPapers discussions

An $O(n^2\log^4 n \log \log n)$ Time Matrix Multiplication Algorithm · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1612.04208/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTAn $O(n^2\log^4 n \log \log n)$ Time Matrix Multiplication Algorithm — mentioned by hnaccyhttps://news.ycombinator.com/item?id=15014202urn:hackerpapers:mention:1612.04208:15014202Tue, 15 Aug 2017 00:06:02 GMT<p>Even experienced people can make "silly" mistakes. https://arxiv.org/abs/1612.04208v1</p><p><a href="https://hackerpaper.kaipfister.de/p/1612.04208/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS