Towards a complexity-theoretic understanding of restarts in SAT solvers

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

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

Publication date: 7 April 2021

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

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68R07: Computational aspects of satisfiability

Uses Software

• Chaff