The complexity of linear programming (Q5904560)

From MaRDI portal
Revision as of 10:45, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3698715
Language Label Description Also known as
English
The complexity of linear programming
scientific article; zbMATH DE number 3698715

    Statements

    title
    The complexity of linear programming (English)
    0 references
    author
    David P. Dobkin
    0 references
    Steven P. Reiss
    0 references
    publication date
    1980
    0 references
    zbMATH DE Number
    3698715
    0 references
    zbMATH Keywords
    LP-complete problems
    0 references
    computability equivalent problems
    0 references
    OpenAlex ID
    W1967036113
    0 references
    cites work
    Q3844775
    0 references
    Q4403756
    0 references
    Q5547252
    0 references
    Q4142699
    0 references
    Q4051879
    0 references
    Q4066843
    0 references
    Q4133127
    0 references
    Q5603731
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5904560&oldid=34645090"
    Powered by MediaWiki