Towards a Complexity-theoretic Understanding of Restarts in SAT solvers

11 May 2020 Li Chunxiao Fleming Noah Vinyals Marc Pitassi Toniann Ganesh Vijay

Restarts are a widely-used class of techniques integral to the efficiency of Conflict-Driven Clause Learning (CDCL) Boolean SAT solvers. While the utility of such policies has been well-established empirically, a theoretical explanation of whether restarts are indeed crucial to the power of CDCL solvers is lacking... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL COMPLEXITY