Pages that link to "Item:Q5092411"

The following pages link to Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411):

Displaying 6 items.

• Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
• On tseitin formulas, read-once branching programs and treewidth (Q2043884) (← links)
• 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)