Solving partial constraint satisfaction problems with tree decomposition (Q4785233)
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: Solving partial constraint satisfaction problems with tree decomposition |
scientific article; zbMATH DE number 1847197
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving partial constraint satisfaction problems with tree decomposition |
scientific article; zbMATH DE number 1847197 |
Statements
Solving partial constraint satisfaction problems with tree decomposition (English)
0 references
17 December 2002
0 references
tree decomposition
0 references
partial constraint
0 references
satisfaction
0 references
frequency assignment
0 references
MAX-SAT
0 references
dynamic programming
0 references
0.7957195043563843
0 references
0.7720069885253906
0 references
0.7511491179466248
0 references
0.7467679977416992
0 references
