Pages that link to "Item:Q4818596"
From MaRDI portal
The following pages link to TETRIS IS HARD, EVEN TO APPROXIMATE (Q4818596):
Displaying 15 items.
- Online square packing with gravity (Q476449) (← links)
- An algorithmic analysis of the Honey-Bee game (Q714789) (← links)
- Morpion solitaire (Q864955) (← links)
- Combinatorial analysis of tetris-like games (Q941345) (← links)
- Tetris and decidability (Q1029095) (← links)
- Threes!, Fives, 1024!, and 2048 are hard (Q1623263) (← links)
- Assembling molecules in ATOMIX is hard (Q1885003) (← links)
- On the complexity of jelly-no-puzzle (Q2695482) (← links)
- Bust-a-Move/Puzzle Bobble Is NP-complete (Q2958090) (← links)
- Tetris is Hard, Even to Approximate (Q3082942) (← links)
- Online Square Packing (Q3183464) (← links)
- On the Complexity of Two Dots for Narrow Boards and Few Colors. (Q3305725) (← links)
- How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)
- Defying gravity and gadget numerosity: the complexity of the Hanano puzzle (Q6175086) (← links)
- Defying gravity and gadget numerosity: the complexity of the Hanano puzzle and beyond (Q6602331) (← links)