On the linear extension complexity of regular \(n\)-gons (Q513256): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2016.12.023 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52C45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68U05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A23 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52B05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6691794 / rank
 
Normal rank
Property / zbMATH Keywords
 
nonnegative rank
Property / zbMATH Keywords: nonnegative rank / rank
 
Normal rank
Property / zbMATH Keywords
 
extension complexity
Property / zbMATH Keywords: extension complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
regular \(n\)-gons
Property / zbMATH Keywords: regular \(n\)-gons / rank
 
Normal rank
Property / zbMATH Keywords
 
nonnegative factorization
Property / zbMATH Keywords: nonnegative factorization / rank
 
Normal rank
Property / zbMATH Keywords
 
Boolean rank
Property / zbMATH Keywords: Boolean rank / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2266668300 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1505.08031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772243 / 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: Q3961028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on nonnegative rank via nonnegative nuclear norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank / 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: Linear vs. semidefinite extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations for polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometric interpretation of the nonnegative rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest compact formulation for the permutahedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which nonnegative matrices are slack matrices? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifts of Convex Sets and Cone Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Extended Formulations from Reflection Relations / 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 of Sperner's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum numbers of faces of a convex polytope / 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: An upper bound for nonnegative rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for exact nonnegative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2016.12.023 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:00, 9 December 2024

scientific article
Language Label Description Also known as
English
On the linear extension complexity of regular \(n\)-gons
scientific article

    Statements

    On the linear extension complexity of regular \(n\)-gons (English)
    0 references
    0 references
    0 references
    0 references
    3 March 2017
    0 references
    nonnegative rank
    0 references
    extension complexity
    0 references
    regular \(n\)-gons
    0 references
    nonnegative factorization
    0 references
    Boolean rank
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references