On the combinatorial complexity of approximating polytopes (Q1688856)

From MaRDI portal
Revision as of 23:24, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the combinatorial complexity of approximating polytopes
scientific article

    Statements

    title
    On the combinatorial complexity of approximating polytopes (English)
    0 references
    author
    Sunil Arya
    0 references
    David M. Mount
    0 references
    publication date
    11 January 2018
    0 references
    zbMATH DE Number
    6824883
    0 references
    zbMATH Keywords
    convex polytopes
    0 references
    polytope approximation
    0 references
    combinatorial complexity
    0 references
    macbeath regions
    0 references
    Wikidata QID
    Q59545298
    0 references
    OpenAlex ID
    W2963756047
    0 references
    arXiv ID
    1604.01175
    0 references
    cites work
    Q2707487
    0 references
    Q3514517
    0 references
    Q3010463
    0 references
    Q5791470
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1688856&oldid=36365057"
    Powered by MediaWiki