No. |
Title |
Author |
Year |
---|

1 |
On the Algebraic Proof Complexity of Tensor Isomorphism |
Galesi, Nicola et al. |
2023 |

2 |
Depth Lower Bounds in Stabbing Planes for Combinatorial Principles |
Dantchev, Stefan et al. |
2022 |

3 |
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares |
Bonacina, Ilario et al. |
2022 |

4 |
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs |
Galesi, Nicola et al. |
2019 |

5 |
Resolution and the Binary Encoding of Combinatorial Principles |
Dantchev, Stefan et al. |
2019 |

6 |
The Space Complexity of Cutting Planes Refutations |
Galesi, Nicola et al. |
2015 |

7 |
SAT Interactions (Dagstuhl Seminar 12471) |
Creignou, Nadia et al. |
2013 |

8 |
Hardness of Parameterized Resolution |
Beyersdorff, Olaf et al. |
2010 |