Model counting for CNF formulas of bounded modular treewidth
From MaRDI portal
Recommendations
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A survey of the algorithmic aspects of modular decomposition
- Algorithms for propositional model counting
- Approximating clique-width and branch-width
- Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Graph minors. X: Obstructions to tree-decomposition
- Handle-rewriting hypergraph grammars
- Homomorphic hashing for sparse coefficient extraction
- scientific article; zbMATH DE number 3426889 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
- Linear time solvable optimization problems on graphs of bounded clique-width
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- On the hardness of approximate reasoning
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- Satisfiability of acyclic and almost acyclic CNF formulas
- Solving \#SAT and Bayesian inference with backtracking search
- The complexity of computing the permanent
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
- Theory and Applications of Satisfiability Testing
- Treewidth. Computations and approximations
- Upper bounds to the clique width of graphs
Cited in
(18)- Exploiting treewidth for projected model counting and its limits
- Counting linear extensions: parameterizations by treewidth
- On efficiently solvable cases of quantum \(k\)-SAT
- New width parameters for SAT and \#SAT
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
- Solving projected model counting by utilizing treewidth and its limits
- Model counting for formulas of bounded clique-width
- Model counting for CNF formulas of bounded modular treewidth
- Community structure inspired algorithms for SAT and \#SAT
- Finer tight bounds for coloring on clique-width
- On efficiently solvable cases of quantum k-SAT
- Sum-of-Products with Default Values: Algorithms and Complexity Results
- Tractable QBF by knowledge compilation
- The use of a pruned modular decomposition for maximum matching algorithms on some graph classes
- Treewidth with a quantifier alternation revisited
- Finer tight bounds for coloring on clique-width
- Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth
- Towards exact structural thresholds for parameterized complexity
This page was built for publication: Model counting for CNF formulas of bounded modular treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334935)
