https://hackerpaper.kaipfister.de/p/cond-mat_0310317/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=21367087urn:hackerpapers:mention:cond-mat_0310317:21367087Sun, 27 Oct 2019 00:00:06 GMT<p>Number partition, if you present it to someone who isn&#x27;t familiar with it, is probably the easiest sounding NP-complete problem. In practice, it&#x27;s definitely one of the easiest ones for practical applications. There&#x27; a paper entitled &quot;The Easiest Hard Problem: Number Partitioning&quot;(https://arxiv.org/pdf/cond-mat/0310317.pdf). But it reduces to subset sum, so it&#x27;s not easy.</p><p><a href="https://hackerpaper.kaipfister.de/p/cond-mat_0310317/">Paper and discussion history</a>. A mention is not an endorsement.</p>cond-mat.dis-nnhttps://news.ycombinator.com/item?id=10023666urn:hackerpapers:mention:cond-mat_0310317:10023666Fri, 07 Aug 2015 17:23:28 GMT<p>Stephen Mertens Paper * The Easiest Hard Problem: Number Partitioning* is a good review paper of the subject covering the phase transition between P and NP this problem exhibits and extending it to k-partitions. http://arxiv.org/abs/cond-mat/0310317</p><p><a href="https://hackerpaper.kaipfister.de/p/cond-mat_0310317/">Paper and discussion history</a>. A mention is not an endorsement.</p>cond-mat.dis-nn