Pages that link to "Item:Q2473047"

The following pages link to Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047):

Displaying 35 items.

• Backdoors to q-Horn (Q261394) (← links)
• Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
• Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
• The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
• On the expressive power of CNF formulas of bounded tree- and clique-width (Q617890) (← links)
• Compact labelings for efficient first-order model-checking (Q626458) (← links)
• The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
• Tensor network contractions for \#SAT (Q887094) (← links)
• Graph classes with and without powers of bounded clique-width (Q896650) (← links)
• An extension of the bivariate chromatic polynomial (Q1041177) (← links)
• Weighted positive binary decision diagrams for exact probabilistic inference (Q1678452) (← links)
• The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
• Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
• On efficiently solvable cases of quantum \(k\)-SAT (Q2223725) (← links)
• An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)
• Algorithms for propositional model counting (Q2266937) (← links)
• Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
• The rank-width of edge-coloured graphs (Q2392245) (← links)
• From tree-decompositions to clique-width terms (Q2413974) (← links)
• Latency-bounded target set selection in social networks (Q2447759) (← links)
• Solving \#SAT using vertex covers (Q2464035) (← links)
• Backdoors to Satisfaction (Q2908542) (← links)
• An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents (Q3007631) (← links)
• Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (Q3007673) (← links)
• Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (Q3012844) (← links)
• $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
• Algorithms for Propositional Model Counting (Q3498488) (← links)
• Variable Influences in Conjunctive Normal Forms (Q3637162) (← links)
• (Q4638063) (← links)
• (Q5005139) (← links)
• Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
• (Q5090465) (← links)
• Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
• A Most General Edge Elimination Polynomial (Q5302041) (← links)
• On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width (Q5302060) (← links)