Better algorithms for satisfiability problems for formulas of bounded rank-width (Q2908838)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Better algorithms for satisfiability problems for formulas of bounded rank-width |
scientific article; zbMATH DE number 6073521
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Better algorithms for satisfiability problems for formulas of bounded rank-width |
scientific article; zbMATH DE number 6073521 |
Statements
29 August 2012
0 references
propositional model counting
0 references
satisfiability
0 references
rank-width
0 references
clique-width
0 references
parameterized complexity
0 references
Better algorithms for satisfiability problems for formulas of bounded rank-width (English)
0 references
