Testing the Complexity of a Valued CSP Language (Q5091236)
From MaRDI portal
scientific article; zbMATH DE number 7561570
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing the Complexity of a Valued CSP Language |
scientific article; zbMATH DE number 7561570 |
Statements
21 July 2022
0 references
valued constraint satisfaction problems
0 references
exponential time algorithms
0 references
exponential time hypothesis
0 references
Testing the Complexity of a Valued CSP Language (English)
0 references
