The Computational Complexity of Integer Programming with Alternations (Q5108263)

From MaRDI portal
Revision as of 18:40, 29 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127409955, #quickstatements; #temporary_batch_1722270516152)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7195319
Language Label Description Also known as
English
The Computational Complexity of Integer Programming with Alternations
scientific article; zbMATH DE number 7195319

    Statements

    title
    The Computational Complexity of Integer Programming with Alternations (English)
    0 references
    author
    Danny Nguyen
    0 references
    Igor Pak
    0 references
    publication date
    30 April 2020
    0 references
    zbMATH Keywords
    programming
    0 references
    integer
    0 references
    theory
    0 references
    computational complexity
    0 references
    integer programming
    0 references
    alternations
    0 references
    projection of integer points
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C10
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    7195319
    0 references
    OpenAlex ID
    W2966775917
    0 references
    Wikidata QID
    Q127409955
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5108263&oldid=36835084"
    Powered by MediaWiki