@InProceedings{bohm_et_al:LIPIcs.SAT.2023.4,
author = {B\"{o}hm, Benjamin and Beyersdorff, Olaf},
title = {{QCDCL vs QBF Resolution: Further Insights}},
booktitle = {26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)},
pages = {4:1--4:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-286-0},
ISSN = {1868-8969},
year = {2023},
volume = {271},
editor = {Mahajan, Meena and Slivovsky, Friedrich},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.4},
URN = {urn:nbn:de:0030-drops-184660},
doi = {10.4230/LIPIcs.SAT.2023.4},
annote = {Keywords: QBF, CDCL, resolution, proof complexity, simulations, lower bounds}
}