PSPACE-Completeness of Bloxorz and of Games with 2-Buttons (Q2947039): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59567446, #quickstatements; #temporary_batch_1711196317277
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1411.5951 / 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: 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

    Identifiers