The Complexity of Reachability in Randomized Sabotage Games (Q3400919)

From MaRDI portal
Revision as of 12:04, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The Complexity of Reachability in Randomized Sabotage Games
scientific article

    Statements

    title
    The Complexity of Reachability in Randomized Sabotage Games (English)
    0 references
    publication date
    28 January 2010
    0 references
    Mathematics Subject Classification ID
    68M15
    0 references
    68Q17
    0 references
    91A43
    0 references
    91A80
    0 references
    zbMATH DE Number
    5663811
    0 references
    zbMATH Keywords
    games
    0 references
    reachability
    0 references
    probabilistic systems
    0 references
    fault-tolerant systems
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3400919&oldid=27745620"
    Powered by MediaWiki