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.
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
{"_id":"6SbZYAXF9gn9bjZeo","bibbaseid":"breukelaar-demaine-hohenberger-janhoogeboom-kosters-libennowell-tetrisishardeventoapproximate-2004","downloads":0,"creationDate":"2015-06-13T03:01:22.444Z","title":"Tetris is hard, even to approximate","author_short":["Breukelaar, R.","Demaine, E. D.","Hohenberger, S.","Jan Hoogeboom, H.","Kosters, W. A.","Liben-Nowell, D."],"year":2004,"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/ijcga/BreukelaarDHHKL04","bibdata":{"title":"Tetris is hard, even to approximate","author":["Ron Breukelaar","Erik D. Demaine","Susan Hohenberger","Hendrik Jan Hoogeboom","Walter A. Kosters","David Liben-Nowell"],"author_short":["Breukelaar, R.","Demaine, E. D.","Hohenberger, S.","Jan Hoogeboom, H.","Kosters, W. A.","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)","bibtex":"@article{ dblp3689681,\n title = {Tetris is hard, even to approximate},\n author = {Ron Breukelaar and Erik D. Demaine and Susan Hohenberger and Hendrik Jan Hoogeboom and Walter A. Kosters and David Liben-Nowell},\n author_short = {Breukelaar, R. and Demaine, E. D. and Hohenberger, S. and Jan Hoogeboom, H. and Kosters, W. A. and Liben-Nowell, D.},\n bibtype = {article},\n type = {article},\n year = {2004},\n key = {dblp3689681},\n id = {dblp3689681},\n biburl = {http://www.dblp.org/rec/bibtex/journals/ijcga/BreukelaarDHHKL04},\n url = {http://dx.doi.org/10.1142/S0218195904001354},\n journal = {Int. J. Comput. Geometry Appl. (IJCGA)},\n pages = {41-68},\n number = {1-2},\n volume = {14},\n text = {Int. J. Comput. Geometry Appl. (IJCGA) 14(1-2):41-68 (2004)}\n}","bibbaseid":"breukelaar-demaine-hohenberger-janhoogeboom-kosters-libennowell-tetrisishardeventoapproximate-2004","role":"author","urls":{"Paper":"http://dx.doi.org/10.1142/S0218195904001354"},"downloads":0},"search_terms":["tetris","hard","even","approximate","breukelaar","demaine","hohenberger","jan hoogeboom","kosters","liben-nowell"],"keywords":[],"authorIDs":[],"dataSources":["hWXun9uoDKcXcjFnG"]}