Pages that link to "Item:Q2084956"
From MaRDI portal
The following pages link to Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956):
Displaying 3 items.
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
- Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies (Q2500481) (← links)
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations (Q5881799) (← links)