| No. |
Title |
Author |
Year |
| 1 |
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning |
Mexi, Gioni et al. |
2023 |
| 2 |
Theory and Practice of SAT and Combinatorial Solving (Dagstuhl Seminar 22411) |
Beyersdorff, Olaf et al. |
2023 |
| 3 |
An Auditable Constraint Programming Solver |
Gocht, Stephan et al. |
2022 |
| 4 |
Certified CNF Translations for Pseudo-Boolean Solving |
Gocht, Stephan et al. |
2022 |
| 5 |
The Power of Negative Reasoning |
de Rezende, Susanna F. et al. |
2021 |
| 6 |
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs |
de Rezende, Susanna F. et al. |
2020 |
| 7 |
Trade-Offs Between Size and Degree in Polynomial Calculus |
Lagarde, Guillaume et al. |
2020 |
| 8 |
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling |
de Rezende, Susanna F. et al. |
2019 |
| 9 |
Proof Complexity (Dagstuhl Seminar 18051) |
Atserias, Albert et al. |
2018 |
| 10 |
Cumulative Space in Black-White Pebbling and Resolution |
Alwen, Joël et al. |
2017 |
| 11 |
Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases |
Lauria, Massimo et al. |
2017 |
| 12 |
Supercritical Space-Width Trade-Offs for Resolution |
Berkholz, Christoph et al. |
2016 |
| 13 |
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds |
Miksa, Mladen et al. |
2015 |
| 14 |
Theory and Practice of SAT Solving (Dagstuhl Seminar 15171) |
Biere, Armin et al. |
2015 |
| 15 |
Tight Size-Degree Bounds for Sums-of-Squares Proofs |
Lauria, Massimo et al. |
2015 |
| 16 |
From Small Space to Small Width in Resolution |
Filmus, Yuval et al. |
2014 |
| 17 |
Understanding space in resolution: optimal lower bounds and exponential trade-offs |
Ben-Sasson, Eli et al. |
2008 |
