next up previous
Next: The Weakest Pseudo-Random Generator Up: The Post-Doctoral Period (1983-86) Previous: How to Construct Random

Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle is NP-Hard


Comments: Authored by O. Goldreich.

Unpublished manuscript, July 1984.



Oded Goldreich
2003-07-30