Pages that link to "Item:Q2408558"
From MaRDI portal
The following pages link to On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth (Q2408558):
Displaying 4 items.
- On limitations of structured (deterministic) DNNFs (Q778525) (← links)
- On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
- On the benefits of knowledge compilation for feature-model analyses (Q6630715) (← links)
- The splitting power of branching programs of bounded repetition and CNFs of bounded width (Q6648277) (← links)
