News for hackers. Stuff that matters.
Re:Machine learning works spectacularly well, but mathematic... by algomanic on Friday December 04, 2015 @12:09PM (#10677505)
My understanding is that in SAT world, random instances are typically easily, even for large numbers of variables. Hard instances only exist in a very narrow band of instance space pertaining to the #constraints/#variables ratio. And yes, it seems like there should be some explanation for this, or maybe it's simply "your intuition for how hard problems should be is wrong".

There are no comments on this comment yet.