Pages that link to "Item:Q334935"
From MaRDI portal
The following pages link to Model counting for CNF formulas of bounded modular treewidth (Q334935):
Displaying 14 items.
- Exploiting treewidth for projected model counting and its limits (Q1656576) (← links)
- Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
- On efficiently solvable cases of quantum \(k\)-SAT (Q2223725) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- Model Counting for CNF Formulas of Bounded Modular Treewidth (Q2957871) (← links)
- (Q5002765) (← links)
- On efficiently solvable cases of quantum \(k\)-SAT (Q5005139) (← links)
- Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
- (Q5090465) (← links)
- (Q5090996) (← links)
- (Q5111886) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)