| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Automating OBDD proofs is NP-hard | Itsykson, Dmitry et al. | 2022 |
| 2 | Tight Bounds for Tseitin Formulas | Itsykson, Dmitry et al. | 2022 |
| 3 | Proof Complexity of Natural Formulas via Communication Arguments | Itsykson, Dmitry et al. | 2021 |
| 4 | Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs | Galesi, Nicola et al. | 2019 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 4 |