https://hackerpaper.kaipfister.de/p/1507.02318/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=19071221urn:hackerpapers:submission:1507.02318:19071221Sun, 03 Feb 2019 18:19:51 GMT<p>A Faster Pseudopolynomial Time Algorithm for Subset Sum (2015)</p><p></p><p>31 points; 3 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/1507.02318/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DShttps://news.ycombinator.com/item?id=15617444urn:hackerpapers:mention:1507.02318:15617444Fri, 03 Nov 2017 08:08:28 GMT<p>Yes, you&#x27;re right. NP-complete. My mistake This arXiv paper shows the STOA from 2015: https://arxiv.org/pdf/1507.02318.pdf It works in pseudopolynomial time. I read that it&#x27;s quite an important problem, related to graphs and encryption.</p><p><a href="https://hackerpaper.kaipfister.de/p/1507.02318/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DShttps://news.ycombinator.com/item?id=9865176urn:hackerpapers:submission:1507.02318:9865176Fri, 10 Jul 2015 17:00:10 GMT<p>A Faster Pseudopolynomial Time Algorithm for Subset Sum</p><p></p><p>34 points; 2 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/1507.02318/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DS