Escamocher, Guillaume; O'Sullivan, Barry; Prestwich, Steven David
(Association for Computing Machinery (ACM), 2020-04-01)
When creating benchmarks for satisfiability (SAT) solvers, we need Conjunctive Normal Form (CNF) instances that are easy to build but hard to solve. A recent development in the search for such methods has led to the Balanced ...