Solving projected model counting by utilizing treewidth and its limits (Q2680775)
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 7638288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving projected model counting by utilizing treewidth and its limits |
scientific article; zbMATH DE number 7638288 |
Statements
Solving projected model counting by utilizing treewidth and its limits (English)
0 references
4 January 2023
0 references
tree decompositions
0 references
high treewidth
0 references
lower bounds
0 references
exponential time hypothesis
0 references
graph problems
0 references
Boolean logic
0 references
counting
0 references
projected model counting
0 references
nested dynamic programming
0 references
hybrid solving
0 references
parameterized algorithms
0 references
parameterized complexity
0 references
computational complexity
0 references
database management systems
0 references
0 references
0 references
0 references
0.9595889
0 references
0.9019733
0 references
0.8631631
0 references
0 references
0 references
0.8565327
0 references
0.84583807
0 references
0.8453917
0 references
0.8410909
0 references
0.8410909
0 references
