Classic Nintendo games are (computationally) hard (Q2347007): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
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
26 May 2015
0 references
Nintendo games
0 references
video games
0 references
computational complexity
0 references
NP-hardness
0 references
PSPACE-hardness
0 references
