Pages that link to "Item:Q617890"
From MaRDI portal
The following pages link to On the expressive power of CNF formulas of bounded tree- and clique-width (Q617890):
Displaying 10 items.
- The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (Q987381) (← links)
- An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- On extremal \(k\)-CNF formulas (Q2509734) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents (Q3007631) (← 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)