Q5089218 (Q5089218): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.MFCS.2020.50 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Formulations of Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Formulations for Packing and Partitioning Orbitopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds for Polytopes in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound technique for the size of nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest compact formulation for the permutahedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal grammar problems for finite languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branched Polyhedral Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Extended Formulations from Reflection Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof that the extension complexity of the correlation polytope grows exponentially / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic Branching Programs with Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polytope of Context-Free Grammar Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the extension complexity of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some \(0/1\) polytopes need exponential size extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.MFCS.2020.50 / rank
 
Normal rank

Latest revision as of 15:53, 30 December 2024

scientific article; zbMATH DE number 7559421
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7559421

    Statements

    0 references
    0 references
    18 July 2022
    0 references
    permutation groups
    0 references
    context free grammars
    0 references
    extension complexity
    0 references
    graph embedding complexity
    0 references

    Identifiers