The following pages link to (Q5121904):
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)
- Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES (Q5148102) (← links)