https://hackerpaper.kaipfister.de/p/1703.03021/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=32022020urn:hackerpapers:mention:1703.03021:32022020Fri, 08 Jul 2022 01:38:48 GMT<p>The solution to the Dichotomy Conjecture for Constraint Satisfaction Problems [1] (also [2], but this proof is much more difficult). This gives a clear dividing line between the types of problems that are easy to solve exactly and the types of problems that are difficult to solve exactly, for a fairly large class of problems. I wouldn&#x27;t even dare to dream that something like this could be done until I saw it happen! [1] https://arxiv.org/pdf/1704.01914.pdf [2] https://arxiv.org/pdf/1703.03021.pdf</p><p><a href="https://hackerpaper.kaipfister.de/p/1703.03021/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.CC