| No. |
Title |
Author |
Year |
| 1 |
Linear Branching Programs and Directional Affine Extractors |
Gryaznov, Svyatoslav et al. |
2022 |
| 2 |
The Propositional Satisfiability Problem -- Algorithms and Lower Bounds (Dagstuhl Seminar 03141) |
Goerdt, Andreas et al. |
2021 |
| 3 |
Proof Complexity (Dagstuhl Seminar 18051) |
Atserias, Albert et al. |
2018 |
| 4 |
Random Resolution Refutations |
Pudlák, Pavel et al. |
2017 |
| 5 |
Representations of Monotone Boolean Functions by Linear Programs |
de Oliveira Oliveira, Mateus et al. |
2017 |
| 6 |
Tighter Hard Instances for PPSZ |
Pudlák, Pavel et al. |
2017 |
| 7 |
The Space Complexity of Cutting Planes Refutations |
Galesi, Nicola et al. |
2015 |
| 8 |
Partition Expanders |
Gavinsky, Dmitry et al. |
2014 |
| 9 |
On extracting computations from propositional proofs (a survey) |
Pudlák, Pavel |
2010 |
| 10 |
06111 Abstracts Collection -- Complexity of Boolean Functions |
Krause, Matthias et al. |
2006 |
| 11 |
06111 Executive Summary -- Complexity of Boolean Functions |
Krause, Matthias et al. |
2006 |
