Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: Nondeterministic constraint logic
Choose Problem

Authors: all
Choose Author


[1]
Robert A. Hearn and Erik D. Demaine,
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation,
Theoretical Computer Science 343(1-2), pp. 72-96, 2005. (LINK)

[42]
Tom C. van der Zanden,
Parameterized complexity of graph constraint logic,
Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Leibniz International Proceedings in Informatics 43, pp. 282-293, 2015. (LINK)