D-FLAT^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 this page instead for the normal view: D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy |
scientific article; zbMATH DE number 6804715
Language | Label | Description | Also known as |
---|---|---|---|
English | D-FLAT^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