Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:15, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting truth assignments of formulas of bounded tree-width or clique-width |
scientific article |
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
