On the combinatorial lower bound for the extension complexity of the spanning tree polytope (Q2417165)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the combinatorial lower bound for the extension complexity of the spanning tree polytope |
scientific article; zbMATH DE number 7064557
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the combinatorial lower bound for the extension complexity of the spanning tree polytope |
scientific article; zbMATH DE number 7064557 |
Statements
On the combinatorial lower bound for the extension complexity of the spanning tree polytope (English)
0 references
11 June 2019
0 references
extension complexity
0 references
communication complexity
0 references
spanning tree polytope
0 references
0 references
