TETRIS IS HARD, EVEN TO APPROXIMATE (Q4818596): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minesweeper is NP-complete. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Games against nature / rank | |||
Normal rank | |||
Revision as of 10:56, 7 June 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
29 September 2004
0 references
Tetris
0 references
computational complexity
0 references
algorithmic combinatorial game theory
0 references
