Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7538272
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.986327350139618
0 references
0.7403246760368347
0 references
0.7347187995910645
0 references
0.730263352394104
0 references
