Classic Nintendo games are (computationally) hard (Q2347007): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1749523692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Two-Dimensional Platform Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaming is a hard job, but someone has to do it! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lemmings is PSPACE-complete / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:49, 10 July 2024

scientific article
Language Label Description Also known as
English
Classic Nintendo games are (computationally) hard
scientific article

    Statements

    Classic Nintendo games are (computationally) hard (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 2015
    0 references
    0 references
    Nintendo games
    0 references
    video games
    0 references
    computational complexity
    0 references
    NP-hardness
    0 references
    PSPACE-hardness
    0 references
    0 references