Towards a Genuinely Polynomial Algorithm for Linear Programming (Q3315270)

From MaRDI portal
Revision as of 21:36, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Towards a Genuinely Polynomial Algorithm for Linear Programming
scientific article

    Statements

    Towards a Genuinely Polynomial Algorithm for Linear Programming (English)
    0 references
    0 references
    1983
    0 references
    convex minimization
    0 references
    computational complexity
    0 references
    genuinely polynomial algorithm
    0 references
    linear inequalities
    0 references
    at most two variables per inequality
    0 references
    binary search
    0 references

    Identifiers