Publisher
Springer International Publishing
Reference7 articles.
1. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971, pp. 151–158. ACM, New York (1971).
https://doi.org/10.1145/800157.805047
2. Demaine, E.D., Hohenberger, S., Liben-Nowell, D.: Tetris is hard, even to approximate. Technical report, MIT-LCS-TR-865. MIT, Cambridge (2002).
https://arxiv.org/abs/cs/0210020
3. Dor, D., Zwick, U.: SOKOBAN and other motion planning problems. Comput. Geom. 13(4), 215–228 (1999).
https://doi.org/10.1016/s0925-7721(99)00017-6
4. Flake, G.W., Baum, E.B.: Rush Hour is PSPACE-complete, or “Why you should generously tip parking lot attendants”. Theor. Comput. Sci. 270(1–2), 895–911 (2002).
https://doi.org/10.1016/s0304-3975(01)00173-6
5. Kaye, R.: Minesweeper is NP-complete. Math. Intell. 22(2), 9–15 (2000).
https://doi.org/10.1007/bf03025367