Solving partial constraint satisfaction problems with tree decomposition (Q4785233): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/net.10046 / rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2741347 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.10046 / rank | |||
Normal rank | |||
Latest revision as of 15:13, 30 December 2024
scientific article; zbMATH DE number 1847197
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
