5 citations · 7 across the 3 of their papers we have counts for
3 papers
Relating Complexity-theoretic Parameters with SAT Solver Performance
Edward Zulkoski, Ruben Martins, Christoph Wintersteiger +4
Over the years complexity theorists have proposed many structural parameters to explain the surprising efficiency of conflict-driven clause-learning (CDCL) SAT solvers on a wide va…
Random CNFs are Hard for Cutting Planes
Noah Fleming, Denis Pankratov, Toniann Pitassi +1
The random k-SAT model is the most important and well-studied distribution over k-SAT instances. It is closely connected to statistical physics; it is used as a testbench for satis…
Path Graphs, Clique Trees, and Flowers
Lalla Mouatadid, Robert Robere
An \emph{asteroidal triple} is a set of three independent vertices in a graph such that any two vertices in the set are connected by a path which avoids the neighbourhood of the th…