"Tetris is NP-hard even with $O(1)$ rows or columns."

Sualeh Asif et al. (2020)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2020-10-07

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2009-14336
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2009-14336
Sualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal:
Tetris is NP-hard even with $O(1)$ rows or columns. CoRR abs/2009.14336 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.