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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Walter A. Kosters / rank
Normal rank
 
Property / author
 
Property / author: Walter A. Kosters / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218195904001354 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2146302034 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:27, 30 July 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
    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
    0 references