From weak to strong linear programming gaps for all constraint satisfaction problems (Q4568111)
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 6890206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From weak to strong linear programming gaps for all constraint satisfaction problems |
scientific article; zbMATH DE number 6890206 |
Statements
15 June 2018
0 references
constraint satisfaction problem
0 references
convex programming
0 references
linear programming hierarchy
0 references
integrality gap
0 references
0 references
0 references
0.9861924648284912
0 references
0.8825033903121948
0 references
0.8556936383247375
0 references
0.8458503484725952
0 references
