Paper by Erik D. Demaine

Sualeh Asif, Erik D. Demaine, Jayson Lynch, and Mihir Singhal, “Tetris is NP-hard even with O(1) Columns”, in Abstracts from the 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2019), Tokyo, Japan, September 6–9, 2019, pages 37–38.

The abstract is 2 pages.

The abstract is available in PDF (1065k).
See information on file formats.
[Google Scholar search]

Related papers:
ThinTetris_JIP (Tetris is NP-hard even with O(1) rows or columns)

Related webpages:
Tetris Font

See also other papers by Erik Demaine.
These pages are generated automagically from a BibTeX file.
Last updated May 28, 2024 by Erik Demaine.