Exponential lower bounds for polytopes in combinatorial optimization (Q2796404)
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 6560185
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponential lower bounds for polytopes in combinatorial optimization |
scientific article; zbMATH DE number 6560185 |
Statements
24 March 2016
0 references
combinatorial optimization
0 references
communication complexity
0 references
linear programming
0 references
quantum communication complexity
0 references
semidefinite programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
Exponential lower bounds for polytopes in combinatorial optimization (English)
0 references
0.9405234456062316
0 references
0.8267872333526611
0 references
0.8236487507820129
0 references
