| No. |
Title |
Author |
Year |
| 1 |
Proof Complexity of Propositional Model Counting |
Beyersdorff, Olaf et al. |
2023 |
| 2 |
QCDCL vs QBF Resolution: Further Insights |
Böhm, Benjamin et al. |
2023 |
| 3 |
Theory and Practice of SAT and Combinatorial Solving (Dagstuhl Seminar 22411) |
Beyersdorff, Olaf et al. |
2023 |
| 4 |
Classes of Hard Formulas for QBF Resolution |
Schleitzer, Agnes et al. |
2022 |
| 5 |
Should Decisions in QCDCL Follow Prefix Order? |
Böhm, Benjamin et al. |
2022 |
| 6 |
Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution |
Beyersdorff, Olaf et al. |
2021 |
| 7 |
Hard QBFs for Merge Resolution |
Beyersdorff, Olaf et al. |
2020 |
| 8 |
SAT and Interactions (Dagstuhl Seminar 20061) |
Beyersdorff, Olaf et al. |
2020 |
| 9 |
Building Strategies into QBF Proofs |
Beyersdorff, Olaf et al. |
2019 |
| 10 |
Genuine Lower Bounds for QBF Expansion |
Beyersdorff, Olaf et al. |
2018 |
| 11 |
Reasons for Hardness in QBF Proof Systems |
Beyersdorff, Olaf et al. |
2018 |
| 12 |
Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs |
Beyersdorff, Olaf et al. |
2018 |
| 13 |
SAT and Interactions (Dagstuhl Seminar 16381) |
Beyersdorff, Olaf et al. |
2017 |
| 14 |
Are Short Proofs Narrow? QBF Resolution is not Simple |
Beyersdorff, Olaf et al. |
2016 |
| 15 |
Understanding Cutting Planes for QBFs |
Beyersdorff, Olaf et al. |
2016 |
| 16 |
Optimal algorithms and proofs (Dagstuhl Seminar 14421) |
Beyersdorff, Olaf et al. |
2015 |
| 17 |
Proof Complexity of Resolution-based QBF Calculi |
Beyersdorff, Olaf et al. |
2015 |
| 18 |
Hardness of Parameterized Resolution |
Beyersdorff, Olaf et al. |
2010 |
| 19 |
Proof Complexity of Propositional Default Logic |
Beyersdorff, Olaf et al. |
2010 |
| 20 |
Edges as Nodes - a New Approach to Timetable Information |
Beyersdorff, Olaf et al. |
2009 |
