Oded Goldreich. Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard. In Oded Goldreich, editor, Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, . Volume 6650 of Lecture Notes in Computer Science, pages 1-5, Springer, 2011. [doi]
@incollection{Goldreich11-0,
title = {Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard},
author = {Oded Goldreich},
year = {2011},
doi = {10.1007/978-3-642-22670-0_1},
url = {http://dx.doi.org/10.1007/978-3-642-22670-0_1},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Goldreich11-0},
cites = {0},
citedby = {0},
pages = {1-5},
booktitle = {Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, },
editor = {Oded Goldreich},
volume = {6650},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-22669-4},
}