Q3301006 (Q3301006): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tetris is Hard, Even to Approximate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super Mario Bros. Is Harder/Easier than We Thought / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for multiplayer noncooperative games of incomplete information / 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: Motion planning among time dependent obstacles / 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: 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

Revision as of 06:00, 23 July 2024

scientific article
Language Label Description Also known as
English
No label defined
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references