Paper by Erik D. Demaine

Reference:

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.

Length:

The abstract is 2 pages.

Availability:

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