Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily

Tobias Friedrich 0001, Frank Neumann 0001, Ralf Rothenberger, Andrew M. Sutton. Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. In Chu Min Li, Felip ManyĆ , editors, Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings. Volume 12831 of Lecture Notes in Computer Science, pages 188-206, Springer, 2021. [doi]

Abstract

Abstract is missing.