D-FLAT\(^\wedge\)2: subset minimization in dynamic programming on tree decompositions made easy (Q4589187)
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 6804715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | D-FLAT\(^\wedge\)2: subset minimization in dynamic programming on tree decompositions made easy |
scientific article; zbMATH DE number 6804715 |
Statements
D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy (English)
0 references
9 November 2017
0 references
subset minimization
0 references
dynamic programming
0 references
tree decomposition
0 references
answer-set programming
0 references
artificial intelligence
0 references
0.8724549412727356
0 references
0.803575873374939
0 references
0.7780918478965759
0 references
0.7744633555412292
0 references
0.7423691749572754
0 references
