CSPs with global modular constraints: algorithms and hardness via polynomial representations (Q5212801): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Venkatesan Guruswami / rank | |||
| Property / author | |||
| Property / author: Venkatesan Guruswami / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2913322957 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1902.04740 / rank | |||
Normal rank | |||
Latest revision as of 23:53, 19 April 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
