CSPs with global modular constraints: algorithms and hardness via polynomial representations (Q5212801)
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 7160537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.97468305
0 references
0 references
0.86793184
0 references
0.8615152
0 references
0.85927886
0 references
0.85695416
0 references
0.85255814
0 references
