Pages that link to "Item:Q1983330"
From MaRDI portal
The following pages link to Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330):
Displaying 4 items.
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations (Q5881799) (← links)