Pages that link to "Item:Q5302060"
From MaRDI portal
The following pages link to On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width (Q5302060):
Displaying 6 items.
- On the expressive power of CNF formulas of bounded tree- and clique-width (Q617890) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- On extremal \(k\)-CNF formulas (Q2509734) (← links)
- Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (Q3012844) (← links)
- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas (Q4930576) (← links)
- A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints (Q5390018) (← links)