Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily

Theory and Applications of Satisfiability Testing – SAT 2021 - Lecture Notes in Computer Science ◽

10.1007/978-3-030-80223-3_13 ◽

2021 ◽

pp. 188-206

Author(s):

Tobias Friedrich ◽

Frank Neumann ◽

Ralf Rothenberger ◽

Andrew M. Sutton

Download Full-text