Tetris and decidability
type: Item
instance of: scholarly article
title: Tetris and decidability
zbMATH Open document ID: 1178.68258
author: Hendrik Jan Hoogeboom
author: Walter A. Kosters
published in: Information Processing Letters
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 5576952
zbMATH Keywords: tetris
zbMATH Keywords: decidability
zbMATH Keywords: theory of computation
MaRDI profile type: Publication
full work available at URL: j.ipl.2003.12.006
OpenAlex ID: W2069105779
cites work: Tetris is Hard, Even to Approximate
cites work: Q5576254
cites work: Q4313096
cites work: A variant of a recursively unsolvable problem
cites work: Covering a Rectangle with T-Tetrominoes
DOI: 10.1016/J.IPL.2003.12.006
description: scientific article; zbMATH DE number 5576952