A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with Restrictions on Top Gates | 0 | 0.34 | 2022 |
Branching Programs with Bounded Repetitions and Flow Formulas. | 0 | 0.34 | 2021 |
Bounded-depth Frege complexity of Tseitin formulas for all graphs. | 0 | 0.34 | 2019 |