Paper by Erik D. Demaine

Reference:
Erik D. Demaine, Susan Hohenberger, and David Liben-Nowell, “Tetris is Hard, Even to Approximate”, in Abstracts from the 12th Annual Fall Workshop on Computational Geometry, Piscataway, New Jersey, November 14–15, 2002.

Updates:
Ivars Peterson wrote an article describing these results, “Tetris Is Hard”, Science News 162(17), October 26, 2002.

Helen Pearson also wrote an article describing these results, “Maths proves Tetris is tough”, Nature Science Update, October 28, 2002.

Sarah Graham also wrote a short article describing these results, “Mathematicians Prove Tetris is Tough”, Scientific American News, October 29, 2002.

Length:
The abstract is 2 pages.

Availability:
The abstract is available in PostScript (691k) and gzipped PostScript (58k).
See information on file formats.
[Google Scholar search]

Related papers:
Tetris_IJCGA (Tetris is Hard, Even to Approximate)
Tetris_COCOON2003 (Tetris is Hard, Even to Approximate)
Tetris_TR2002 (Tetris is Hard, Even to Approximate)


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