How fast can we play Tetris greedily with rectangular pieces?
From MaRDI portal
Publication:6149495
DOI10.1016/j.tcs.2024.114405arXiv2202.10771OpenAlexW4391179638MaRDI QIDQ6149495
Publication date: 5 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.10771
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weighted fusion frame construction via spectral tetris
- Gowers' Ramsey theorem for generalized tetris operations
- A steganographic method based on tetris games
- Combinatorial analysis of tetris-like games
- Artificial intelligence: Theories, models and applications. 6th Hellenic conference on AI, SETN 2010, Athens, Greece, May 4--7, 2010. Proceedings
- Tetris and decidability
- Algorithms and computation. 8th international symposium, ISAAC '97, Singapore, December 17--19, 1997. Proceedings
- From Tetris to polyominoes generation
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
- On a class of \(O(n^ 2)\) problems in computational geometry
- Dynamic geometric data structures via shallow cuttings
- Mind the gap!
- Subquadratic algorithms for 3SUM
- Towards polynomial lower bounds for dynamic problems
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
- Tetris is Hard, Even to Approximate
- Learning Tetris Using the Noisy Cross-Entropy Method
- Fast and Simple Connectivity in Graph Timelines
- Faster All-Pairs Shortest Paths via Circuit Complexity
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
- Dynamic DFS in Undirected Graphs: breaking the O(m) barrier
- Higher Lower Bounds from the 3SUM Conjecture
- On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter
- Semi-Online Maintenance of Geometric Optima and Measures
- TETRIS IS HARD, EVEN TO APPROXIMATE
- More Logarithmic-factor Speedups for 3SUM, (median,+)-convolution, and Some Geometric 3SUM-hard Problems
- Reducibility among Combinatorial Problems
- Dynamic Parameterized Problems and Algorithms
- ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
- Tetris: Using Software/Hardware Co-Design to Enable Handheld, Physics-Limited 3D Plane-Wave Ultrasound Imaging
- On Hardness of Jumbled Indexing
- Color-Distance Oracles and Snippets
- The complexity of theorem-proving procedures
This page was built for publication: How fast can we play Tetris greedily with rectangular pieces?
