Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5241060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting truth assignments of formulas of bounded tree-width or clique-width |
scientific article; zbMATH DE number 5241060 |
Statements
Counting truth assignments of formulas of bounded tree-width or clique-width (English)
0 references
26 February 2008
0 references
satisfiability (SAT)
0 references
counting problems
0 references
fixed parameter tractable (FPT)
0 references
tree-width
0 references
clique-width
0 references
0 references
0 references
0 references
0.90490115
0 references
0.90490115
0 references
0.8908074
0 references
0.89008623
0 references
0.8774567
0 references
0.87428886
0 references
0.86723685
0 references
0.86606264
0 references
