Towards a Complexity-theoretic Understanding of Restarts in SAT solvers

Li Chunxiao
Li Chunxiao
Fleming Noah
Fleming Noah
Vinyals Marc
Vinyals Marc
Ganesh Vijay
Ganesh Vijay

SAT, pp. 233-249, 2020.

Cited by: 0|Bibtex|Views22|DOI:https://doi.org/10.1007/978-3-030-51825-7_17
EI
Other Links: arxiv.org|dblp.uni-trier.de|academic.microsoft.com

Abstract:

Restarts are a widely used class of techniques integral to the efficiency of Conflict-Driven Clause Learning (CDCL) SAT solvers. While the utility of such policies has been well-established empirically, until now we didn't have a complexity-theoretic understanding of why restart policies are crucial to the power of CDCL SAT solvers. I...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments