Tetris is hard, even to approximate. Breukelaar, R., Demaine, E. D., Hohenberger, S., Jan Hoogeboom, H., Kosters, W. A., & Liben-Nowell, D. Int. J. Comput. Geometry Appl. (IJCGA), 14(1-2):41-68, 2004.
Tetris is hard, even to approximate [link]Paper  bibtex   
@article{ dblp3689681,
  title = {Tetris is hard, even to approximate},
  author = {Ron Breukelaar and Erik D. Demaine and Susan Hohenberger and Hendrik Jan Hoogeboom and Walter A. Kosters and David Liben-Nowell},
  author_short = {Breukelaar, R. and Demaine, E. D. and Hohenberger, S. and Jan Hoogeboom, H. and Kosters, W. A. and Liben-Nowell, D.},
  bibtype = {article},
  type = {article},
  year = {2004},
  key = {dblp3689681},
  id = {dblp3689681},
  biburl = {http://www.dblp.org/rec/bibtex/journals/ijcga/BreukelaarDHHKL04},
  url = {http://dx.doi.org/10.1142/S0218195904001354},
  journal = {Int. J. Comput. Geometry Appl. (IJCGA)},
  pages = {41-68},
  number = {1-2},
  volume = {14},
  text = {Int. J. Comput. Geometry Appl. (IJCGA) 14(1-2):41-68 (2004)}
}

Downloads: 0