Pages that link to "Item:Q2908838"
From MaRDI portal
The following pages link to Better algorithms for satisfiability problems for formulas of bounded rank-width (Q2908838):
Displaying 7 items.
- Backdoors to q-Horn (Q261394) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (Q3007673) (← links)
- Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width (Q4914311) (← links)
- Theory and Applications of Satisfiability Testing (Q5325859) (← links)