On the combinatorial lower bound for the extension complexity of the spanning tree polytope (Q2417165)

From MaRDI portal
Revision as of 23:26, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references
    0 references
    11 June 2019
    0 references
    0 references
    extension complexity
    0 references
    communication complexity
    0 references
    spanning tree polytope
    0 references
    0 references