A subexponential bound for linear programming (Q1923862)

From MaRDI portal
Revision as of 23:28, 27 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q54309309, #quickstatements; #temporary_batch_1711574657256)
scientific article
Language Label Description Also known as
English
A subexponential bound for linear programming
scientific article

    Statements

    title
    A subexponential bound for linear programming (English)
    0 references
    published in
    Algorithmica
    0 references
    publication date
    18 February 1997
    0 references
    zbMATH Keywords
    combinatorial optimization
    0 references
    randomized incremental algorithms
    0 references
    author
    Ji{ří} Matoušek
    0 references
    Micha Sharir
    0 references
    Ermo Welzl
    0 references

    Identifiers

    DOI
    10.1007/BF01940877
    0 references
    zbMATH DE Number
    934123
    0 references
    Wikidata QID
    Q54309309
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1923862&oldid=33218275"
    Powered by MediaWiki