Paper by Erik D. Demaine

Greg Aloupis, Erik D. Demaine, Alan Guo, and Giovanni Viglietta, “Classic Nintendo Games are (Computationally) Hard”, Theoretical Computer Science, volume 586, 2015, pages 135–160.

This paper is also available from ScienceDirect and as arXiv:1203.1895.

Currently unavailable. If you are in a rush for copies, contact me.
[Google Scholar search]

Related papers:
Nintendo_FUN2014 (Classic Nintendo Games are (Computationally) Hard)

See also other papers by Erik Demaine.
These pages are generated automagically from a BibTeX file.
Last updated March 27, 2017 by Erik Demaine.