Extension complexity of low-dimensional polytopes (Q5082401): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3034864005 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2006.08836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Nonnegative Matrix Factorization---Provably / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3436866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random points and lattice points in convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Few points to generate a random polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real rank versus nonnegative rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Polyhedral Approximations of the Second-Order Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation of Matrices and Nonnegative Rank with a View toward Statistical Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration inequalities using the entropy method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastical approximation of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Constraint Satisfaction Requires Large LP Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds on nonnegative rank and extended formulations / 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: Extended formulations for polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which nonnegative matrices are slack matrices? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonnegative rank of distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Polytopes / 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 the nonnegative rank of Euclidean distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Optimal Algorithm for Computing Nonnegative Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension Complexity of Polytopes with Few Vertices or Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygons as sections of higher-dimensional polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry Matters for Sizes of Extended Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur L'enveloppe convexe des nuages de points aleatoires dans <i>R<sup>n</sup></i>. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The combinatorial structure of random polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matching Polytope has Exponential Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on pairs of families with restricted intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tropical lower bound for extended formulations. II. Deficiency graphs of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for nonnegative rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the determinant of a sparse 0-1 matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean distance matrices and separations in communication complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and probability. Abstracts from the workshop held April 14--20, 2013. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for exact nonnegative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation and Decomposition of Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nonnegative Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp concentration of random polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank

Latest revision as of 08:08, 29 July 2024

scientific article; zbMATH DE number 7542924
Language Label Description Also known as
English
Extension complexity of low-dimensional polytopes
scientific article; zbMATH DE number 7542924

    Statements

    Extension complexity of low-dimensional polytopes (English)
    0 references
    0 references
    0 references
    0 references
    16 June 2022
    0 references
    extension complexity
    0 references
    combinatorial optimisation
    0 references
    low-dimensional polytopes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers