CSPs with global modular constraints: algorithms and hardness via polynomial representations (Q5212801): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:30, 8 February 2024
scientific article; zbMATH DE number 7160537
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | CSPs with global modular constraints: algorithms and hardness via polynomial representations |
scientific article; zbMATH DE number 7160537 |
Statements
CSPs with global modular constraints: algorithms and hardness via polynomial representations (English)
0 references
30 January 2020
0 references
constraint satisfaction problems
0 references
exponential time hypothesis (ETH)
0 references
matching vector families
0 references
modular constraints
0 references
polynomial representations
0 references
submodular minimization
0 references
