Pages that link to "Item:Q4914311"
From MaRDI portal
The following pages link to Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width (Q4914311):
Displaying 11 items.
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
- On efficiently solvable cases of quantum \(k\)-SAT (Q2223725) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Community Structure Inspired Algorithms for SAT and #SAT (Q3453228) (← links)
- (Q5005139) (← links)
- On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
- Fast FPT-approximation of branchwidth (Q6593764) (← links)
