On decidability and complexity of low-dimensional robot games (Q2009641)

From MaRDI portal
Revision as of 19:44, 4 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127353368, #quickstatements; #temporary_batch_1722793424638)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On decidability and complexity of low-dimensional robot games
scientific article

    Statements

    title
    On decidability and complexity of low-dimensional robot games (English)
    0 references
    author
    J. Reichert
    0 references
    Reino Niskanen
    0 references
    Igor Potapov
    0 references
    publication date
    29 November 2019
    0 references
    zbMATH Keywords
    reachability games
    0 references
    vector addition game
    0 references
    decidability
    0 references
    winning strategy
    0 references
    integer vector addition system
    0 references
    cites work
    Energy parity games
    0 references
    Computer Science Logic
    0 references
    Q5367063
    0 references
    Q5009428
    0 references
    Borel determinacy
    0 references
    Q4992530
    0 references
    Q2753678
    0 references
    Q4270062
    0 references
    Q5590814
    0 references
    Q5144652
    0 references
    Q4636651
    0 references
    Minkowski Games
    0 references

    Identifiers

    Mathematics Subject Classification ID
    91A05
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    7138697
    0 references
    OpenAlex ID
    W2969299158
    0 references
    Wikidata QID
    Q127353368
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2009641&oldid=37579133"
    Powered by MediaWiki