TETRIS IS HARD, EVEN TO APPROXIMATE (Q4818596): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1029094
Property / author
 
Property / author: Walter A. Kosters / rank
Normal rank
 

Revision as of 03:56, 22 February 2024

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

    TETRIS IS HARD, EVEN TO APPROXIMATE (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 September 2004
    0 references
    Tetris
    0 references
    computational complexity
    0 references
    algorithmic combinatorial game theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references