Classic Nintendo games are (computationally) hard (Q2347007)

From MaRDI portal
Revision as of 03:05, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Classic Nintendo games are (computationally) hard
scientific article

    Statements

    title
    Classic Nintendo games are (computationally) hard (English)
    0 references
    author
    Greg Aloupis
    0 references
    Erik D. Demaine
    0 references
    Alan Guo
    0 references
    Giovanni Viglietta
    0 references
    publication date
    26 May 2015
    0 references
    zbMATH Keywords
    Nintendo games
    0 references
    video games
    0 references
    computational complexity
    0 references
    NP-hardness
    0 references
    PSPACE-hardness
    0 references

    Identifiers

    zbMATH DE Number
    6439773
    0 references
    OpenAlex ID
    W1749523692
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2347007&oldid=39024222"
    Powered by MediaWiki