PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation (Q2570127)

From MaRDI portal
scientific article
Language Label Description Also known as
English
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
scientific article

    Statements

    PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation (English)
    0 references
    0 references
    0 references
    26 October 2005
    0 references
    Combinatorial puzzles
    0 references
    Sliding blocks
    0 references
    Computational complexity
    0 references
    Hardness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references