Pages that link to "Item:Q309788"
From MaRDI portal
The following pages link to On the read-once property of branching programs and CNFs of bounded treewidth (Q309788):
Displaying 6 items.
- On limitations of structured (deterministic) DNNFs (Q778525) (← links)
- On tseitin formulas, read-once branching programs and treewidth (Q2043884) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
- On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth (Q2408558) (← links)
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations (Q5881799) (← links)
