Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666)
From MaRDI portal
scientific article; zbMATH DE number 7538272
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations |
scientific article; zbMATH DE number 7538272 |
Statements
Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (English)
0 references
8 June 2022
0 references
constraint satisfaction problems
0 references
computational complexity
0 references
algorithms
0 references
error-correcting codes
0 references
0 references
0 references
0 references
0 references
