| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Depth Lower Bounds in Stabbing Planes for Combinatorial Principles | Dantchev, Stefan et al. | 2022 |
| 2 | On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares | Bonacina, Ilario et al. | 2022 |
| 3 | Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs | Galesi, Nicola et al. | 2019 |
| 4 | Resolution and the Binary Encoding of Combinatorial Principles | Dantchev, Stefan et al. | 2019 |
| 5 | The Space Complexity of Cutting Planes Refutations | Galesi, Nicola et al. | 2015 |
| 6 | SAT Interactions (Dagstuhl Seminar 12471) | Creignou, Nadia et al. | 2013 |
| 7 | Hardness of Parameterized Resolution | Beyersdorff, Olaf et al. | 2010 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |