On the combinatorial lower bound for the extension complexity of the spanning tree polytope (Q2417165): Difference between revisions
From MaRDI portal
Revision as of 12:42, 19 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the combinatorial lower bound for the extension complexity of the spanning tree polytope |
scientific article |
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