Q6126484 (Q6126484): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Classic Nintendo games are (computationally) hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3305736 / 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: The Computational Complexity of Portal and Other 3D Video Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875768 / 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: On two geometric problems related to the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-Completeness of Bloxorz and of Games with 2-Buttons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank

Revision as of 20:51, 29 August 2024

scientific article; zbMATH DE number 7829453
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7829453

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references