Pages that link to "Item:Q3082942"
From MaRDI portal
The following pages link to Tetris is Hard, Even to Approximate (Q3082942):
Displaying 13 items.
- Hanabi is NP-hard, even for cheaters who look at their cards (Q528493) (← links)
- The complexity of flood filling games (Q692938) (← links)
- Tetravex is NP-complete (Q845713) (← links)
- On a generalization of ``eight blocks to madness'' puzzle (Q906490) (← links)
- Tetris and decidability (Q1029095) (← links)
- Wooden geometric puzzles: Design and hardness proofs (Q2272190) (← links)
- The computational complexity of Angry Birds (Q2302303) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Graph kernels and Gaussian processes for relational reinforcement learning (Q2433177) (← links)
- The complexity of comparing optimal solutions (Q2671811) (← links)
- The Computational Complexity of Portal and Other 3D Video Games (Q3301006) (← links)
- LaserTank is NP-Complete (Q5014691) (← links)
- How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)