TETRIS IS HARD, EVEN TO APPROXIMATE (Q4818596)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: TETRIS IS HARD, EVEN TO APPROXIMATE |
scientific article; zbMATH DE number 2104295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | TETRIS IS HARD, EVEN TO APPROXIMATE |
scientific article; zbMATH DE number 2104295 |
Statements
TETRIS IS HARD, EVEN TO APPROXIMATE (English)
0 references
29 September 2004
0 references
Tetris
0 references
computational complexity
0 references
algorithmic combinatorial game theory
0 references
0 references
0 references
0.7306286
0 references
0 references
0.7258182
0 references
0.72515976
0 references
