3 citations · 6 across the 9 of their papers we have counts for
1 paper · 1 filter
Olivier Bailleux
We propose to use local search algorithms to produce SAT instances which are harder to solve than randomly generated k-CNF formulae. The first results, obtained with rudimentary se…