Towards a complexity-theoretic understanding of restarts in SAT solvers

DOI10.1007/978-3-030-51825-7_17OpenAlexW3038610974MaRDI QIDQ2661349

Chun-Xiao Li, Vijay Ganesh, Toniann Pitassi, Marc Vinyals, Noah Fleming

Publication date: 7 April 2021

Full work available at URL: https://arxiv.org/abs/2003.02323

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Related Items (1)

On CDCL-Based Proof Systems with the Ordered Decision Strategy

Uses Software

• Chaff

This page was built for publication: Towards a complexity-theoretic understanding of restarts in SAT solvers