Pages that link to "Item:Q4636642"
From MaRDI portal
The following pages link to On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables (Q4636642):
Displaying 6 items.
- A direct construction of polynomial-size OBDD proof of pigeon hole problem (Q987797) (← links)
- 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)
- Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. (Q5111240) (← links)
- (Q5121904) (← links)
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES (Q5148102) (← links)