PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation (Q2570127)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2217955
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation |
scientific article; zbMATH DE number 2217955 |
Statements
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation (English)
0 references
26 October 2005
0 references
Combinatorial puzzles
0 references
Sliding blocks
0 references
Computational complexity
0 references
Hardness
0 references
0 references
0.82826936
0 references
0.82826936
0 references
0.8279547
0 references
0.8256074
0 references
0.82351047
0 references
