Single Parameter FPT-Algorithms for Non-trivial Games (Q3000500)

From MaRDI portal
Revision as of 02:10, 22 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q58803152, #quickstatements; #temporary_batch_1711055989931)
scientific article
Language Label Description Also known as
English
Single Parameter FPT-Algorithms for Non-trivial Games
scientific article

    Statements

    title
    Single Parameter FPT-Algorithms for Non-trivial Games (English)
    0 references
    author
    Mahdi Parsa
    0 references
    publication date
    19 May 2011
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q17
    0 references
    91A05
    0 references
    91A10
    0 references
    91A43
    0 references
    zbMATH DE Number
    5897205
    0 references
    zbMATH Keywords
    algorithmic game theory
    0 references
    computational complexity
    0 references
    OpenAlex ID
    W2398380006
    0 references
    Wikidata QID
    Q58803152
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3000500&oldid=33145992"
    Powered by MediaWiki