PSPACE-Completeness of Bloxorz and of Games with 2-Buttons (Q2947039): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
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: Computational Complexity of Two-Dimensional Platform Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation / 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: Q3395518 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Undirected connectivity in log-space / rank | |||
Normal rank |
Latest revision as of 18:37, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | PSPACE-Completeness of Bloxorz and of Games with 2-Buttons |
scientific article |
Statements
PSPACE-Completeness of Bloxorz and of Games with 2-Buttons (English)
0 references
21 September 2015
0 references