Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.06.020 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090518395 / rank | |||
Normal rank | |||
Revision as of 20:03, 19 March 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
