Erik D. Demaine, Susan Hohenberger, David Liben-Nowell  Home/Search
Context
Related
Links: DBLP | mit.edu/~dln/papers/t...fallworkshop.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/~dln/research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: g the online version. It is also natural to let m and n grow, since a relatively simple dynamic program solves the case of m n = O(1) in time poly(p). NP-hardness of maximizing rows cleared. We rst show that maximizing the number of rows cleared while playing the given sequence is NP- complete. Our proof proceeds by a reduction from 3-Partition, in which we are given a set S = fa 1 ; : : : ; a 3s g of integers and a bound T , and asked to partition S into s sets of three numbers each,... (Update)
Active bibliography (related documents): More All
0.5: Tetris is Hard, Even to Approximate - Breukelaar, Demaine, Hohenberger.. (Correct)
0.0: Decision Algorithms for Multiplayer Non-Cooperative Games.. - Peterson, Reif, Azhar (Correct)
0.0: PSPACE has constant-round quantum interactive proof systems - Watrous (1999) (Correct)
Similar documents based on text: More All
0.7: How to Lose at Tetris - Burgiel (1997) (Correct)
0.5: A Tetris Controller -- An Example of a Discrete Event Dynamic.. - R. Germundsson (1991) (Correct)
0.5: Demonstrational and Constraint-Based Techniques for.. - Zanden, Myers (1995) (Correct)
BibTeX entry: (Update)
@misc{ demaine-tetris,
author = "Erik D. Demaine and Susan Hohenberger and David Liben-Nowell",
title = "Tetris is Hard, Even to Approximate",
url = "citeseer.ist.psu.edu/592000.html" }
Citations (may not include all citations):572 Computers and Intractability (context) - Garey, Johnson ACM
58 Games against nature (context) - Papadimitriou - 1985 ACM DBLP
2 even to approximate (context) - Demaine, Hohenberger et al. - 2002
Documents on the same site (http://theory.lcs.mit.edu/~dln/research.html): More
The Syntenic Diameter of the Space of N-Chromosome Genomes - Kleinberg, Liben-Nowell (2000) (Correct)
On the Structure of Syntenic Distance - Liben-Nowell (1999) (Correct)
Gossip is Synteny: Incomplete Gossip and an Exact Algorithm.. - Liben-Nowell (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC