https://hackerpaper.kaipfister.de/p/1411.4798/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=16018614urn:hackerpapers:mention:1411.4798:16018614Wed, 27 Dec 2017 22:29:44 GMT<p>It&#x27;s worth noting that Scott Aaronson has commented on previous work by the same authors: https://www.scottaaronson.com/blog/?p=2212 . At the time, he was convinced that their approach wouldn&#x27;t scale. I&#x27;m not sure about their current approach, but at a glance it seems similar to the previous one. Previous work: https://arxiv.org/pdf/1411.4798.pdf</p><p><a href="https://hackerpaper.kaipfister.de/p/1411.4798/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.EThttps://news.ycombinator.com/item?id=8652475urn:hackerpapers:submission:1411.4798:8652475Mon, 24 Nov 2014 14:28:51 GMT<p>Memcomputing NP-complete problems in polynomial time</p><p></p><p>87 points; 64 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/1411.4798/">Paper and source history</a>. A submission is not an endorsement.</p>cs.ET