3 ms·
Wasn't there also a connection between solving constraint satisfaction (k-SAT Boolean CSP examples) where the clause length to the number of clauses makes it su
by itissid 5y ago
Wasn't there also a connection between solving constraint satisfaction (k-SAT Boolean CSP examples) where the clause length to the number of clauses makes it super easy or super hard for solvers to solve for a solution?
I vaguely remember this from reading literature when writing heuristic solvers for my CS grad course in AI search.
- itissid 5y agoTo answer my own question here are some references to the problem at hand https://dl.acm.org/doi/10.1145/3491210 https://dl.acm.org/doi/10.1145/3491210