TETRIS IS HARD, EVEN TO APPROXIMATE
From MaRDI portal
Publication:4818596
DOI10.1142/S0218195904001354zbMath1093.90045MaRDI QIDQ4818596
Erik D. Demaine, Hendrik Jan Hoogeboom, Susan Hohenberger, David Liben-Nowell, Walter A. Kosters, Ron Breukelaar
Publication date: 29 September 2004
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
90C60: Abstract computational complexity for mathematical programming problems
91A99: Game theory
90C27: Combinatorial optimization
05A99: Enumerative combinatorics