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.

BibTeX

@InProceedings{ThinTetris_JCDCGGG2019,
  AUTHOR        = {Sualeh Asif and Erik D. Demaine and Jayson Lynch and Mihir Singhal},
  TITLE         = {Tetris is {NP}-hard even with {$O(1)$} Columns},
  BOOKTITLE     = {Abstracts from the 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2019)},
  bookurl       = {http://www.jcdcgg.u-tokai.ac.jp/JCDCG3_2019_abstracts_v1.pdf},
  ADDRESS       = {Tokyo, Japan},
  MONTH         = {September 6--9},
  YEAR          = 2019,
  PAGES         = {37--38},

  withstudent   = 1,
  length        = {2 pages},
  paperkind     = {abstract},
  unrefereed    = 1,
  papers        = {ThinTetris_JIP},
  webpages      = {fonts/tetris},
}

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