On the combinatorial lower bound for the extension complexity of the spanning tree polytope (Q2417165): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2586559425 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:26, 19 March 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
