Albert Atserias. Proof Complexity and Its Relations to SAT Solving (Invited Talk). In Olaf Beyersdorff, Michal Pilipczuk, Elaine Pimentel, Kim Thang Nguyen, editors, 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4-7, 2025, Jena, Germany. Volume 327 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. [doi]
@inproceedings{Atserias25,
title = {Proof Complexity and Its Relations to SAT Solving (Invited Talk)},
author = {Albert Atserias},
year = {2025},
doi = {10.4230/LIPIcs.STACS.2025.1},
url = {https://doi.org/10.4230/LIPIcs.STACS.2025.1},
researchr = {https://researchr.org/publication/Atserias25},
cites = {0},
citedby = {0},
booktitle = {42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4-7, 2025, Jena, Germany},
editor = {Olaf Beyersdorff and Michal Pilipczuk and Elaine Pimentel and Kim Thang Nguyen},
volume = {327},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-365-2},
}