Hiding satisfying assignments
AchlioptasDimitris, JiaHaixia, MooreCristopher · 2005
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k- SAT formulas who...