Name
Title | Citations | PageRank | Year |
|---|---|---|---|
| Automating OBDD proofs is NP-hard | 0 | 0.34 | 2022 |
| Tight Bounds for Tseitin Formulas | 0 | 0.34 | 2022 |
| Proof Complexity of Natural Formulas via Communication Arguments. | 0 | 0.34 | 2021 |
| Bounded-depth Frege complexity of Tseitin formulas for all graphs. | 0 | 0.34 | 2019 |