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]

@inproceedings{FriedrichNRS21,
  title = {Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily},
  author = {Tobias Friedrich 0001 and Frank Neumann 0001 and Ralf Rothenberger and Andrew M. Sutton},
  year = {2021},
  doi = {10.1007/978-3-030-80223-3_13},
  url = {https://doi.org/10.1007/978-3-030-80223-3_13},
  researchr = {https://researchr.org/publication/FriedrichNRS21},
  cites = {0},
  citedby = {0},
  pages = {188-206},
  booktitle = {Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings},
  editor = {Chu Min Li and Felip ManyĆ },
  volume = {12831},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-80223-3},
}