Tetris and decidability (Q1029095): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tetris is Hard, Even to Approximate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4313096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of a recursively unsolvable problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a Rectangle with T-Tetrominoes / rank
 
Normal rank

Latest revision as of 19:04, 1 July 2024

scientific article
Language Label Description Also known as
English
Tetris and decidability
scientific article

    Statements

    Tetris and decidability (English)
    0 references
    0 references
    0 references
    9 July 2009
    0 references
    tetris
    0 references
    decidability
    0 references
    theory of computation
    0 references

    Identifiers