Recursive Backdoors for SAT

Nikolas Mählmann, Sebastian Siebertz, Alexandre Vigny. Recursive Backdoors for SAT. In Filippo Bonchi, Simon J. Puglisi, editors, 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia. Volume 202 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

@inproceedings{MahlmannSV21,
  title = {Recursive Backdoors for SAT},
  author = {Nikolas Mählmann and Sebastian Siebertz and Alexandre Vigny},
  year = {2021},
  doi = {10.4230/LIPIcs.MFCS.2021.73},
  url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.73},
  researchr = {https://researchr.org/publication/MahlmannSV21},
  cites = {0},
  citedby = {0},
  booktitle = {46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia},
  editor = {Filippo Bonchi and Simon J. Puglisi},
  volume = {202},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-201-3},
}