203 citations · 391 across the 22 of their papers we have counts for
3 papers · 1 filter
Concurrent Cube-and-Conquer
Peter van der Tak, Marijn J. H. Heule, Armin Biere
Recent work introduced the cube-and-conquer technique to solve hard SAT instances. It partitions the search space into cubes using a lookahead solver. Each cube is tackled by a con…
Symbiosis of Search and Heuristics for Random 3-SAT
Sid Mijnders, Boris de Wilde, Marijn Heule
When combined properly, search techniques can reveal the full potential of sophisticated branching heuristics. We demonstrate this observation on the well-known class of random 3-S…
A SAT Approach to Clique-Width
Marijn J. H. Heule, Stefan Szeider
Clique-width is a graph invariant that has been widely studied in combinatorics and computer science. However, computing the clique-width of a graph is an intricate problem, the ex…