TETRIS IS HARD, EVEN TO APPROXIMATE (Q4818596)

From MaRDI portal
Revision as of 10:27, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2104295
Language Label Description Also known as
English
TETRIS IS HARD, EVEN TO APPROXIMATE
scientific article; zbMATH DE number 2104295

    Statements

    title
    TETRIS IS HARD, EVEN TO APPROXIMATE (English)
    0 references
    author
    Ron Breukelaar
    0 references
    Erik D. Demaine
    0 references
    Susan Hohenberger
    0 references
    Hendrik Jan Hoogeboom
    0 references
    David Liben-Nowell
    0 references
    Walter A. Kosters
    0 references
    publication date
    29 September 2004
    0 references
    zbMATH Keywords
    Tetris
    0 references
    computational complexity
    0 references
    algorithmic combinatorial game theory
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C27
    0 references
    05A99
    0 references
    90C60
    0 references
    91A99
    0 references
    zbMATH DE Number
    2104295
    0 references
    OpenAlex ID
    W2146302034
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4818596&oldid=37280646"
    Powered by MediaWiki