Push-Pull Block Puzzles are Hard (Q5283366): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1709.01241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5282798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classic Nintendo games are (computationally) hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOKOBAN and other motion planning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Motion planning in the presence of movable obstacles / rank
 
Normal rank

Latest revision as of 03:42, 14 July 2024

scientific article; zbMATH DE number 6751061
Language Label Description Also known as
English
Push-Pull Block Puzzles are Hard
scientific article; zbMATH DE number 6751061

    Statements

    Identifiers