Pages that link to "Item:Q5111240"
From MaRDI portal
The following pages link to Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. (Q5111240):
Displaying 4 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)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations (Q5881799) (← links)
