Q6126482 (Q6126482): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by the same user not shown) | |||
Property / cites work | |||
Property / cites work: Classic Nintendo games are (computationally) hard / 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 | |||
Property / cites work | |||
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Walking through doors is hard, even without staircases: proving PSPACE-hardness via planar assemblies of door gadgets / rank | |||
Normal rank |
Latest revision as of 13:22, 4 December 2024
scientific article; zbMATH DE number 7829452
Language | Label | Description | Also known as |
---|---|---|---|
English | No label defined |
scientific article; zbMATH DE number 7829452 |
Statements
9 April 2024
0 references
video games
0 references
hardness
0 references
PSPACE
0 references